de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Carathéodory Bounds for Integer Cones

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44373

Eisenbrand,  Friedrich
Discrete Optimization, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45475

Shmonin,  Gennady
Discrete Optimization, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Eisenbrand, F., & Shmonin, G. (2006). Carathéodory Bounds for Integer Cones. Operations Research Letters, 34(5), 564-568. Retrieved from http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6V8M-4HHH4T4-1-6S&_cdi=5874&_user=43521&_orig=search&_coverDate=09%2F30%2F2006&_sk=999659994&view=c&wchp=dGLzVlz-zSkWA&md5=e10b8e7703fa15c994768b9bc7bd21c3&ie=/sdarticle.pdf.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-249A-3
Abstract
We provide analogues of Carathéodory'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.