论文信息 - Carathéodory bounds for integer cones

Carathéodory 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.

Friedrich Eisenbrand | Gennady Shmonin | F. Eisenbrand | Gennady Shmonin

[1] Odile Marcotte. An instance of the cutting stock problem for which the rounding property does not hold , 1986 .

[2] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[3] David G. Larman,et al. The vertices of the knapsack polytope , 1983, Discret. Appl. Math..

[4] András Sebö,et al. Hilbert Bases, Caratheodory's Theorem and Combinatorial Optimization , 1990, IPCO.

[5] William J. Cook,et al. An integer analogue of Carathéodory's theorem , 1986, J. Comb. Theory, Ser. B.

[6] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[7] Frits C. R. Spieksma,et al. A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths , 2001, Math. Oper. Res..

[8] Alexander Martin,et al. A counterexample to an integer analogue of Carathéodory's theorem , 1999 .