Caratheodory bounds for integer cones

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.


Published in:
Operations Research Letters, 34, 5, 564 - 568
Year:
2006
Laboratories:




 Record created 2008-05-13, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)