Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs
From MaRDI portal
Publication:5704092
DOI10.1287/moor.27.3.470.315zbMath1082.90551OpenAlexW2076349558MaRDI QIDQ5704092
Laurence A. Wolsey, Quentin Louveaux
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ee714bfcfab9e3204820c07287468e24f75eaef9
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
Column basis reduction and decomposable knapsack problems ⋮ Lattice based extended formulations for integer linear equality systems ⋮ Thinner is not always better: cascade knapsack problems ⋮ Intermediate integer programming representations using value disjunctions ⋮ Lattice Reformulation Cuts ⋮ On the Structure of Reduced Kernel Lattice Bases ⋮ Integer-programming software systems