Solving market split problems with heuristical lattice reduction

Heiko Vogel ()

Annals of Operations Research, 2012, vol. 196, issue 1, 590 pages

Abstract: The market sharing problem was proposed by M. Dawande and G. Cornuéjols (INFORMS J. Comput. 11, 1999 ) to compare the performance of linear integer programming algorithms. Haibo Wang (Manuscript No. 251, Annuals of Operations Research, 2008 ) examined some hard instances of these problems and reported the results he obtained with the commercially available program CPLEX. This paper first describes a model, which allows to embed integer programs with inequalities into a lattice and then reports the progress with Wang’s instances, by using a lattice based algorithm which employs a new heuristical sieving procedure. These results are compared to recent CPLEX 12.0 benchmarks. Copyright Springer Science+Business Media, LLC 2012

Keywords: Integer programming; Lattice reduction; Heuristic evaluation (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-012-1143-0 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:196:y:2012:i:1:p:581-590:10.1007/s10479-012-1143-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-012-1143-0

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().