Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
From MaRDI portal
Publication:4427331
DOI10.1287/IJOC.12.3.192.12635zbMATH Open1040.90023OpenAlexW2152037116MaRDI QIDQ4427331FDOQ4427331
Authors: Karen Aardal, Arjen K. Lenstra, Job W. Smeltink, Robert E. Bixby, Cor Hurkens 
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
Recommendations
Cited In (18)
- Thinner is not always better: cascade knapsack problems
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
- Progress in presolving for mixed integer programming
- Column basis reduction and decomposable knapsack problems
- Exact algorithms for the equitable traveling salesman problem
- Lattice Reformulation Cuts
- Lattice based extended formulations for integer linear equality systems
- On the Consistent Path Problem
- Comments on the paper: ``Attacking the market split problem with lattice point enumeration by A. Wasserman.
- Attacking the market split problem with lattice point enumeration
- Intermediate integer programming representations using value disjunctions
- Branching on general disjunctions
- Improved strategies for branching on general disjunctions
- High generalization performance structured self-attention model for knapsack problem
- Sparse recovery with integrality constraints
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Lower bounds on the size of general branch-and-bound trees
- Bounds on the size of branch-and-bound proofs for integer knapsacks
This page was built for publication: Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427331)
