A Hybrid Genetic Algorithm for the Two - Dimensional Guillotine Cutting Problem
暂无分享,去创建一个
[1] Ralph E. Gomory,et al. The Theory and Computation of Knapsack Functions , 1966, Oper. Res..
[2] Francis J. Vasko. A computational improvement to Wang's two-dimensional cutting stock algorithm , 1989 .
[3] Arlindo Gomes de Alvarenga,et al. Exact solutions for constrained two-dimensional cutting problems , 1995 .
[4] Michael de la Maza,et al. Book review: Genetic Algorithms + Data Structures = Evolution Programs by Zbigniew Michalewicz (Springer-Verlag, 1992) , 1993 .
[5] Harald Dyckhoff,et al. A typology of cutting and packing problems , 1990 .
[6] A. Bagchi,et al. Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems , 1993, Oper. Res..
[7] Anthony I. Hinxman,et al. Problem Reduction and the Two-Dimensional Trim-Loss Problem , 1976, AISB.
[8] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[9] Alfred V. Aho,et al. Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.
[10] A. I. Hinxman. The trim-loss and assortment problems: A survey , 1980 .
[11] Reinaldo Morabito,et al. An and—or-graph approach for two-dimensional cutting problems , 1992 .
[12] Judea Pearl,et al. Heuristics : intelligent search strategies for computer problem solving , 1984 .
[13] P. Y. Wang,et al. Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems , 1983, Oper. Res..
[14] JoséFernando Oliveira,et al. An improved version of Wang's algorithm for two-dimensional cutting problems , 1990 .