The Integer Knapsack Cover Polyhedron

DOI10.1137/050639624zbMath1177.90298OpenAlexW2089032662MaRDI QIDQ3519194

Hande Yaman

Publication date: 13 August 2008

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/23309

zbMATH Keywords

valid inequalitiesfacetssequence-independent liftinginteger knapsack cover polyhedron

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (5)

Knapsack polytopes: a survey ⋮ Lifting for the integer knapsack cover polyhedron ⋮ Manufacturer's mixed pallet design problem ⋮ Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets ⋮ Formulations and valid inequalities for the heterogeneous vehicle routing problem

This page was built for publication: The Integer Knapsack Cover Polyhedron