Merging valid inequalities over the multiple knapsack polyhedron

From MaRDI portal

Revision as of 10:21, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2627629

Jump to:navigation, search

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 programming valid inequalities polyhedral theory multiple knapsack inequality 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 (3)

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

This page was built for publication: Merging valid inequalities over the multiple knapsack polyhedron

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2627629&oldid=15422901"