English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Carathéodory Bounds for Integer Cones

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Eisenbrand, Friedrich1, Author           
Shmonin, Gennady1, Author           
Affiliations:
1Discrete Optimization, MPI for Informatics, Max Planck Society, ou_1116548              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2007-03-042006
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Operations Research Letters
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Amsterdam : North-Holland
Pages: - Volume / Issue: 34 (5) Sequence Number: - Start / End Page: 564 - 568 Identifier: ISSN: 0167-6377
CoNE: https://pure.mpg.de/cone/journals/resource/954925483661