Loading...
research article
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.
Loading...
Name
conic.pdf
Access type
openaccess
Size
88.13 KB
Format
Adobe PDF
Checksum (MD5)
cd6e76806ee573f106740238a98de30e