Integer and combinatorial optimization
Integer and combinatorial optimization
Solving multi-item capacitated lot-sizing problems using variable redefinition
Operations Research
Forest covers and a polyhedral intersection theorem
Mathematical Programming: Series A and B
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
| Hi-index | 0.00 |
Given a family of mixed 0-1 polyhedra, we suppose that the convex hull of solutions is known. Now we add a cardinality constraint such that the sum of the 0-1 variables is exactly k. When is the resulting polyhedron integral, or when does the resulting linear program have an integral optimal solution for all values of k? Various equivalent conditions are given, and it is shown that uncapacitated lot-sizing polyhedra have this property when the production costs are nonincreasing over time.