Market split and basis reduction: Towards a solution of the cornuéjols-dawande instances

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1610, Issue , 1999, Pages 1-16

  Aardal, Karen ^a   Bixby, Robert E ^b   Hurkens, Cor A J ^c   Lenstra, Arjen K ^d   Smeltink, Job W ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

^b Rice University   (United States)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^d Emerging Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMMERCE; LINEAR PROGRAMMING;

0-1 LINEAR PROGRAMMING; BASIS REDUCTION; COMPUTATIONAL RESULTS; GENERAL METHOD; LATTICE BASIS REDUCTION; LINEAR DIOPHANTINE EQUATIONS; PROBABILISTIC ANALYSIS;

INTEGER PROGRAMMING;

EID: 22644448553     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48777-8_1     Document Type: Conference Paper

References (12)

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