Simple lifted cover inequalities and hard knapsack problems
From MaRDI portal
Publication:2581317
DOI10.1016/j.disopt.2005.06.003zbMath1131.90051MaRDI QIDQ2581317
Craig A. Tovey, Brady Hunsaker
Publication date: 9 January 2006
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2005.06.003
90C35: Programming involving graphs or networks
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C27: Combinatorial optimization
Related Items
Yet harder knapsack problems, Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
Cites Work