Merging valid inequalities over the multiple knapsack polyhedron

DOI10.1504/IJOR.2015.071495zbMath1362.90297OpenAlexW2102694748MaRDI QIDQ2627629

Todd Easton, Randal Hickman

Publication date: 31 May 2017

Published in: International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijor.2015.071495

zbMATH Keywords

integer programmingvalid inequalitiespolyhedral theorymultiple knapsackinequality merging

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Knapsack polytopes: a survey, Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, Approximate and exact merging of knapsack constraints with cover inequalities