Packing Optimization for Digital Fabrication
暂无分享,去创建一个
[1] Renzo Orsini,et al. A Heuristic Solution of the Rectangular Cutting Stock Problem , 1980, Comput. J..
[2] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[3] P. Kolesar. A Branch and Bound Algorithm for the Knapsack Problem , 1967 .
[4] Benny K. Nielsen. An efficient solution method for relaxed variants of the nesting problem , 2007, CATS.
[5] Daniele Vigo,et al. Approximation algorithms for the oriented two-dimensional bin packing problem , 1999, Eur. J. Oper. Res..
[6] Branko Kolarevic,et al. Architecture in the Digital Age: Design and Manufacturing , 2004 .
[7] Harald Dyckhoff,et al. A typology of cutting and packing problems , 1990 .
[8] G. S. Lueker,et al. Bin packing can be solved within 1 + ε in linear time , 1981 .
[9] Gerhard Wäscher,et al. An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..
[10] Nicos Christofides,et al. An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..
[11] Daniel L. Schodek,et al. Digital Design and Manufacturing: CAD/CAM Applications in Architecture and Design , 2004 .
[12] H. Okano,et al. A SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM , 2002 .
[13] Antonio Albano,et al. Optimal Allocation of Two-Dimensional Irregular Shapes Using Heuristic Search Methods , 1980, IEEE Transactions on Systems, Man, and Cybernetics.
[14] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[15] Lisa Iwamoto,et al. Digital Fabrications: Architectural and Material Techniques , 2009 .
[16] E. Goodman,et al. A Genetic Algorithm Approach to Compaction, Bin Packing, and Nesting Problems , 1994 .