Simple lifted cover inequalities and hard knapsack problems
From MaRDI portal
Publication:2581317
DOI10.1016/j.disopt.2005.06.003zbMath1131.90051OpenAlexW2032140426MaRDI QIDQ2581317
Brady Hunsaker, Craig A. Tovey
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
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Knapsack polytopes: a survey ⋮ Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness ⋮ Yet harder knapsack problems ⋮ Approximate and exact merging of knapsack constraints with cover inequalities ⋮ Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
Cites Work