| Article ID: | iaor2007951 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 5 |
| Start Page Number: | 564 |
| End Page Number: | 568 |
| Publication Date: | Sep 2006 |
| Journal: | Operations Research Letters |
| Authors: | Eisenbrand Friedrich, Shmonin Gennady |
| Keywords: | cutting stock |
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.