An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E86-A, Issue 5, 2003, Pages 1093-1102

  Umetani, Shunji ^a   Yagiura, Mutsunori ^a   Ibaraki, Toshihide ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Cutting stock problem; Linear programming; Local search; Pattern minimization

Indexed keywords

CUTTING; HEURISTIC METHODS; LINEAR PROGRAMMING; PERTURBATION TECHNIQUES;

CUTTING STOCK PROBLEM;

COMBINATORIAL MATHEMATICS;

EID: 0141972492     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. H. Foerster and G. Wäscher, "Pattern reduction in one-dimensional cutting stock problems," International Journal of Production Research, vol.38, pp.1657-1676, 2000.
2. M.R. Garey and D.S. Johnson, Computers and intractability - a guide to the theory of NP-completeness - W.H. Freeman and Company, 1979.
3. T. Gau and G. Wäscher, "CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem," European J. Operational Research, vol.84, pp.572-579, 1995.
4. P.C. Gilmore and R.E. Gomory, "A linear programming approach to the cutting-stock problem," Oper. Res., vol.9, pp.849-859, 1961.
5. P.C. Gilmore and R.E. Gomory, "A linear programming approach to the cutting-stock problem - Part II," Oper. Res., vol.11, pp.863-888, 1963.
6. C. Goulimis, "Optimal solutions for the cutting stock problem, " European J. Operational Research, vol.44, pp.197-208, 1990.
7. R.E. Haessler, "Controlling cutting pattern changes in one-dimensional trim problems," Oper. Res., vol.23, pp.483-493, 1975.
8. R.E. Johnston, "Rounding algorithm for cutting stock problems, " J. Asian-Pacific Operations Research Societies, vol.3, pp.166-171, 1986.
9. O. Marcotte, "The cutting stock problem and integer rounding," Mathematical Programming, vol.33, pp.82-92, 1985.
10. G. Scheithauer and J. Terno, "Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem," Operations Research Letters, vol.20, pp.93-100, 1997.
11. H. Stadtler, "A one-dimensional cutting stock problem in aluminum industry and its solution," European J. Operational Research, vol.44, pp.209-233, 1990.
12. T. Terlaky, "A convergent criss-cross method," Mathematische Operationsforscheung und Statistics ser. Optimization, vol.16, pp.683-690, 1985.
13. P.H. Vance, "Branch-and-price algorithm for the one-dimensional cutting stock problem," Computational Optimization and Applications, vol.9, pp.211-228, 1998.
14. F. Vanderbeck, "Computational study of a column generation algorithm for bin packing and cutting stock problems," Math. Program., vol.86, pp.565-594, 1999.
15. S. Zionts, "The criss-cross method for solving linear programming problems," Management Science, vol.15, pp.426-445, 1969.