On LP relaxations for the pattern minimization problem

Networks

Volumn 57, Issue 3, 2011, Pages 247-253

  Aloisio, Alessandro ^a   Arbib, Claudio ^a   Marinelli, Fabrizio ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITÀ POLITECNICA DELLE MARCHE   (Italy)

Author keywords

cutting stock; integer decomposition; linear relaxations

Indexed keywords

COLUMN GENERATION; CUTTING STOCK; INTEGER DECOMPOSITION; LINEAR RELAXATIONS; LOWER BOUNDS; LP RELAXATION; MINIMIZATION PROBLEMS; NUMERICAL TESTS;

OPTIMIZATION;

EID: 79955427439     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20422     Document Type: Conference Paper

References (14)

1. C. Alves, Cutting and packing: Problems, models and exact algorithms, PhD Thesis, Universidade do Minho, 2005.
2. C. Alves, R. Macedo, and, J.V. de Carvalho, New lower bounds based on column generation and constraint programming for the pattern minimization problem, Comput Oper Res 36 (2009), 2944-2954.
3. C. Arbib, and, F. Marinelli, Integrating process optimization and inventory planning in cutting-stock with skiving option: An optimization model and its application, Eur J Oper Res 163 (2005), 617-630.
4. G. Belov, and, G. Scheithauer, The number of setups (different patterns) in one-dimensional stock cutting, Technical Report, Institute of Numerical Mathematics, Technische Universität Dresden, 2003. Preprint MATH-NM-15-2003.
5. J.V. de Carvalho, LP models for bin-packing and cutting stock problems, Eur J Oper Res 141 (2002), 253-273.
6. G. Desaulniers, J. Desrosiers, I. Ioachim, M. Salomon, F. Soumis, and, D. Villeneuve, "A unified framework for deterministic time constrained routing and crew scheduling problems", Fleet management and logistics, T.G. Crainic, and, G. Laporte, (Editors), Kluwer Academic Publishers, Boston, 1998, pp. 57-93.
7. H. Dyckhoff, G. Scheithauer, and, J. Terno, "Cutting and packing (C&P)", Annotated bibliographies in combinatorial optimization, M. Dell'Amico, F. Maffioli, S. Martello, (Editors), Wiley, Chichester, 1997, pp. 393-413.
8. T. Gau, and, G. Wäscher, CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem, Eur J Oper Res 84 (1995), 572-579.
9. P.C. Gilmore, and, R.E. Gomory, A linear programming approach to the cutting stock problem-Part II, Oper Res 11 (1963), 863-888.
10. M. Haouari, and, A. Gharbi, Fast lifting procedures for the bin packing problem, Discrete Optim 2 (2005), 201-218. (Pubitemid 41500039)
11. L.V. Kantorovich, Mathematical models of organising and planning production, Manage Sci 6 (1960), 366-422.
12. S. Umetani, M. Yagiura, and, T. Ibaraki, One-dimensional cutting stock problem to minimize the number of different patterns, Eur J Oper Res 146 (2003), 388-402.
13. F. Vanderbeck, Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem, Oper Res 48 (2000), 915-926. (Pubitemid 32189514)
14. F. Vanderbeck, and, M.W.P. Savelsbergh, A generic view of Dantzig-Wolfe decomposition in mixed integer programming, Oper Res Lett 34 (2006), 296-306. (Pubitemid 43242946)