Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances

INFORMS Journal on Computing

Volumn 12, Issue 3, 2000, Pages 192-202

  Aardal, K ^a   Bixby, R E ^b   Hurkens, C A J ^c   Lenstra, A K ^d   Smeltink, J W ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

^b Rice University   (United States)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^d Citibank NA   (United States)

Author keywords

Lattice basis reduction; Small hard instances

Indexed keywords

EID: 0001068003     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.12.3.192.12635     Document Type: Article

References (14)

1. Aardal, K., C. Hurkens, A.K. Lenstra. 1998. Solving a system of linear diophantine equations with lower and upper bounds on the variables. Research report UU-CS-1998-36, Department of Computer Science, Utrecht University, Utrecht, The Netherlands. To appear in Mathematics of Operations Research.
2. Aardal, K., R. Weismantel, L.A. Wolsey. 1999. Non-standard approaches to integer programming. Research report UU-CS-1999-41, Department of Computer Science, Utrecht University, Utrecht, The Netherlands.
3. Cornuéjols, G., M. Dawande. 1998. A class of hard small 0-1 programs. R.E. Bixby, E.A. Boyd, R.Z. Rfos-Mercado, eds. Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, lecture notes in Computer Science 1412. Springer-Verlag, Berlin. 284-293.
4. CPLEX 6.0 Documentation Supplement. 1998. ILOG Inc., CPLEX Division, Incline Village, NV.
5. CPLEX 6.5 Documentation Supplement. 1999. ILOG Inc., CPLEX Division, Incline Village, NV.
6. Grimmett, G.R., D.R. Stirzaker. 1982. Probability and Random Processes. Oxford University Press, Oxford, United Kingdom.
7. Lenstra, A.K., H.W. Lenstra, Jr., L. Lovász. 1982. Factoring polynomials with rational coefficients. Mathematische Annalen 261, 515-534.
8. Lenstra, H.W., Jr. 1983. Integer programming with a fixed number of variables. Mathematics of Operations Research 8, 538-548.
9. LiDIA - A library for computational number theory. TH Darmstadt/ Universität des Saarlandes, Fachbereich Informatik, Institut für Theoretische Informatik, Darmstadt, Germany. http://www.informatik.th-darmstadt.de/pub/TI/LiDIA.
10. Lovász, L., H.E. Scarf. 1992. The generalized basis reduction algorithm. Mathematics of Operations Research 17, 751-764.
11. MIPLIB. Rice University, Houston, TX. http://www.caam.rice.edu/~bixby/miplib/miplib3.html.
12. Schrijver, A. 1986. Theory of Linear and Integer Programming. Wiley, Chichester, United Kingdom.
13. Verweij, A.M. 1998. The UHFCO Library. Department of Computer Science, Utrecht University, Utrecht, The Netherlands.
14. Williams, H.P. 1978. Model Building in Mathematical Programming. Wiley, Chichester, United Kingdom.