Attacking the Market Split Problem with Lattice Point Enumeration

The market split problem was proposed by Cornuéjols and Dawande as benchmark problem for algorithms solving linear systems with 0/1 variables. Here, we present an algorithm for the more general problem A · x = b with arbitrary lower and upper bound on the variables. The algorithm consists of exhaustive enumeration of all points of a suitable lattice which are contained in a given polyhedron. We present results for the feasibility version as well as for the integer programming version of the market split problem which indicate that the algorithm outperforms the previously published approaches to this problems considerably.

[1]  Martin W. P. Savelsbergh,et al.  An Updated Mixed Integer Programming Library: MIPLIB 3.0 , 1998 .

[2]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  R. R. Coveyou,et al.  Fourier Analysis of Uniform Random Number Generators , 1967, JACM.

[5]  Claus-Peter Schnorr,et al.  An Improved Low-Denisty Subset Sum Algorithm , 1991, EUROCRYPT.

[6]  U. Fincke,et al.  Improved methods for calculating vectors of short length in a lattice , 1985 .

[7]  Henri Cohen,et al.  A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[8]  Arjen K. Lenstra,et al.  Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables , 1998, IPCO.

[9]  Arjen K. Lenstra,et al.  Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances , 2000, INFORMS J. Comput..

[10]  Arjen K. Lenstra,et al.  Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances , 1999, INFORMS J. Comput..

[11]  U. Dieter,et al.  How to calculate shortest vectors in a lattice , 1975 .

[12]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[13]  Ravi Kannan,et al.  Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..

[14]  Michael Kaib,et al.  Block Reduction for Arbitrary Norms , 1994 .

[15]  Alfred Wassermann,et al.  Finding simple t-designs with enumeration techniques , 1998 .

[16]  Jeffrey C. Lagarias,et al.  Solving low density subset sum problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[17]  H. P. Williams,et al.  Model Building in Mathematical Programming , 1979 .

[18]  Milind Dawande,et al.  A Class of Hard Small 0-1 Programs , 1998, INFORMS J. Comput..

[19]  Antoine Joux,et al.  Improving the Critical Density of the Lagarias-Odlyzko Attack Against Subset Sum Problems , 1991, FCT.

[20]  John D. C. Little,et al.  On model building , 1993 .