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.
Type
research article
Author(s)
Shmonin, Gennady
Date Issued
2006
Published in
Volume
34
Issue
5
Start page
564
End page
568
Editorial or Peer reviewed
REVIEWED
Written at
OTHER
EPFL units
Available on Infoscience
May 13, 2008
Use this identifier to reference this record