Tighter relaxations for the cutting stock problem

European Journal of Operational Research

Volumn 112, Issue 3, 1999, Pages 654-663

  Nitsche, Christoph ^a   Scheithauer, Guntram ^a   Terno, Johannes ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Cutting stock problem; Linear programming relaxation; Modified integer round up property

Indexed keywords

HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; RELAXATION PROCESSES;

CUTTING STOCK PROBLEMS (CSP); LINEAR PROGRAMMING RELAXATION METHOD; MODIFIED INTEGER ROUND-UP PROPERTY;

INVENTORY CONTROL;

EID: 0033078451     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00404-9     Document Type: Article

References (20)

1. H. Dyckhoff, U. Finke, Cutting and packing in production and distribution, Physica Verlag, Heidelberg, 1992.
2. H. Dyckhoff, G. Scheithauer, J. Terno, Cutting and Packing, in: M. Dell'Amico, F. Maffioli, S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester, 1997, pp. 393-412.
3. Gilmore P.C., Gomory R.E. A linear programming approach to the cutting-stock problem (Part I). Operations Research. 9:1961;849-859.
4. O. Marcotte, Topics in combinatorial packing and covering, Technical Report 568, School of Oper. Res. and Ind. Eng., Cornell University, Ithaca, NY, 1982.
5. Marcotte O. The cutting stock problem and integer rounding. Mathematical Programming. 33/1:1985;82-92.
6. Marcotte O. An instance of the cutting stock problem for which the rounding property does not hold. Operations Research Letters. 4/5:1986;239-243.
7. A. Diegel, Integer LP solution for large trim problems, University of Natal, South Africa, Working Paper, 1988.
8. G. Scheithauer, J. Terno, About the gap between the optimal values of the integer and continuous relaxation one-dimensional cutting stock problem, in: Operations Research Proceedings, Springer, Berlin, 1992, pp. 439-444.
9. Scheithauer G., Terno J. Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem. Operations Research Letters. 20:1997;93-100.
10. Scheithauer G., Terno J. The modified integer round-up property of the one-dimensional cutting stock problem. European Journal of Operational Research. 84:1995;562-571.
11. G. Wäscher, T. Gau, Two approaches to the cutting stock problem, IFORS '93 Conference, Lisboa, 1993.
12. M. Fieldhouse, The duality gap in trim problems, SICUP-Bulletin, 5, 1990.
13. V. Nica, General counterexample to the integer round-up property, Technical Report, Bucharest, 1994.
14. J. Terno, R. Lindemann, G. Scheithauer, Zuschnittprobleme und ihre praktische Lösung, Verlag Harri Deutsch, Thun und Frankfurt/Main, 1987.
15. Scheithauer G., Terno J. A branch-and-bound algorithm for solving one-dimensional cutting stock problems exactly. Applicationes Mathematicae. 23/2:1995;151-167.
16. G. Wäscher, T. Gau, Generating almost optimal solutions for the integer one-dimensional cutting stock problem, Technical Report 94/06, TU Braunschweig, 1994.
17. Baum S., Trotter L.E. Jr. Integer rounding for polymatroid and branching optimization problems. SIAM Journal on Algebraic and Discrete Methods. 2/4:1981;416-425.
18. C. Nitsche, G. Scheithauer, J. Terno, New cases of the cutting stock problem having MIRUP, Technical Report MATH-NM-17-1996, TU Dresden, 1996, to appear in Mathematical Methods of Operations Research (ZOR).
19. G.L. Nemhauser, A.H.G. Rinnooy Kan, M.J. Todd, Optimization, Handbooks in OR and MS, vol.1, North Holland, Amsterdam, 1989.
20. C. Nitsche, Theoretische Untersuchungen zur Integer Round-Up Property beim eindimensionalen Zuschnittproblem. Diplomarbeit, TU Dresden, 1996.