The integer knapsack cover polyhedron
Date
2007
Authors
Yaman, H.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
3
views
views
29
downloads
downloads
Citation Stats
Series
Abstract
We study the integer knapsack cover polyhedron which is the convex hull of the set of vectors x ∈ ℤ+ n that satisfy C T x ≥ b, with C ∈ ℤ++ n and 6 ∈ ℤ++. We present some general results about the nontrivial facet-defining inequalities. Then we derive specific families of valid inequalities, namely, rounding, residual capacity, and lifted rounding inequalities, and identify cases where they define facets. We also study some known families of valid inequalities called 2-partition inequalities and improve them using sequence-independent lifting.
Source Title
SIAM Journal on Discrete Mathematics
Publisher
Society for Industrial and Applied Mathematics
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English