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.
Record created on 2008-05-13, modified on 2016-08-08