A cutting stock problem and its solution in the manufacturing industry of large electric generators
暂无分享,去创建一个
[1] José M. Valério de Carvalho,et al. LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..
[2] Moises Sudit,et al. PROCEDURES FOR SOLVING SINGLE-PASS STRIP LAYOUT PROBLEMS , 1994 .
[3] José Fernando Oliveira,et al. A 2-exchange heuristic for nesting problems , 2002, Eur. J. Oper. Res..
[4] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[5] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[6] Rohit Sharma,et al. An integrated machine vision based system for solving the nonconvex cutting stock problem using genetic algorithms , 1999 .
[7] T. J. Nye. Optimal nesting of irregular convex blanks in strips via an exact algorithm , 2001 .
[8] Kamineni Pitcheswara Rao,et al. Large-scale nesting of irregular patterns using compact neighborhood algorithm , 2000 .
[9] Sanjay V. Rajopadhye,et al. Unbounded knapsack problem: Dynamic programming revisited , 2000, Eur. J. Oper. Res..
[10] A. Ramesh Babu,et al. A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms , 2001, Comput. Aided Des..