论文信息 - Sufficient Conditions for the Integer Round-Up Property to Be Violated for the Linear Cutting Stock Problem - 字舞流文

Sufficient Conditions for the Integer Round-Up Property to Be Violated for the Linear Cutting Stock Problem

The integer round-up property of the linear cutting stock problem is investigated. An algorithm for verifying the sufficient conditions under which the problem has no integer round-up property is designed.

[1] Christoph Nitsche,et al. New cases of the cutting stock problem having MIRUP , 1998, Math. Methods Oper. Res..

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

[3] Harald Dyckhoff,et al. A typology of cutting and packing problems , 1990 .

[4] L. Trotter,et al. Integer Rounding for Polymatroid and Branching Optimization Problems , 1981 .

[5] Odile Marcotte. The cutting stock problem and integer rounding , 1985, Math. Program..

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7] Gleb Belov,et al. Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB) , 2000 .