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

DOI10.1287/ijoc.12.3.192.12635zbMath1040.90023OpenAlexW2152037116MaRDI QIDQ4427331

Karen Aardal, Arjen K. Lenstra, Job W. Smeltink, Cor A. J. Hurkens, Robert E. Bixby

Publication date: 28 October 2003

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/149452

Mathematics Subject Classification ID

Integer programming (90C10) Boolean programming (90C09)

Related Items

Column basis reduction and decomposable knapsack problems, Lattice based extended formulations for integer linear equality systems, Sparse recovery with integrality constraints, Lower bounds on the size of general branch-and-bound trees, Progress in presolving for mixed integer programming, Improved strategies for branching on general disjunctions, Bounds on the size of branch-and-bound proofs for integer knapsacks, Thinner is not always better: cascade knapsack problems, On the Consistent Path Problem, Intermediate integer programming representations using value disjunctions, Lattice Reformulation Cuts, Exact algorithms for the equitable traveling salesman problem, Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices, Branching on general disjunctions, Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II, High generalization performance structured self-attention model for knapsack problem