Caratheodory bounds for integer cones

• Published in: Operations Research Letters, vol. 34, num. 5, p. 564 - 568
• Publication date: 2006

We provide analogues of Caratheodory'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. © 2005 Elsevier B.V. All rights reserved.

Reference

• DISOPT-ARTICLE-2006-001
• doi:10.1016/j.orl.2005.09.008

Record created on 2008-05-13, modified on 2012-03-21