Skip to main navigation Skip to search Skip to main content

Solving the market split problem using a distributed computation approach

    Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

    Abstract

    A distributed implementation of Dang's Fixed-Point iterative method is proposed to solve the market split problem which has been considered as a benchmark and a challenge to the algorithms solving linear systems with 0/1 variables. There are two steps to solve the market split problem in this paper. The first step is converting the problem to a reformulated polytope judgement problem based on lattice basis reduction. In the next step, the distributed Dang's method is used to judge whether there exits an integer point in the polytope. This is the first distributed implementation to solve the market split problem to our knowledge. Numerical results show that the approach is effective and it is more powerful than CPLEX to solve the market split problem. © 2013 IEEE.
    Original languageEnglish
    Title of host publication2013 IEEE International Conference on Information and Automation, ICIA 2013
    Pages1252-1257
    DOIs
    Publication statusPublished - 2013
    Event2013 IEEE International Conference on Information and Automation, ICIA 2013 - Yinchuan, China
    Duration: 26 Aug 201328 Aug 2013

    Conference

    Conference2013 IEEE International Conference on Information and Automation, ICIA 2013
    PlaceChina
    CityYinchuan
    Period26/08/1328/08/13

    Research Keywords

    • Basis Reduction
    • Distributed Implementation
    • Fixed-Point Iterative Method
    • Market Split Problem

    Fingerprint

    Dive into the research topics of 'Solving the market split problem using a distributed computation approach'. Together they form a unique fingerprint.

    Cite this