| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143339 | Operations Research Letters | 2006 | 5 Pages |
Abstract
We provide analogues of Carathéodory's theorem for integer cones and apply our bounds to integer programming and to the cutting stock problem. In particular, we provide an NP certificate for the latter, whose existence has not been known so far.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Friedrich Eisenbrand, Gennady Shmonin,