Laser Cutting Layout Based on Particle Swarm Optimization and Graphic Interference Detecting
暂无分享,去创建一个
[1] Kathryn A. Dowsland,et al. An algorithm for polygon placement using a bottom-left strategy , 2002, Eur. J. Oper. Res..
[2] Ernesto G. Birgin,et al. Orthogonal packing of identical rectangles within isotropic convex regions , 2010, Comput. Ind. Eng..
[3] Chak-Kuen Wong,et al. An effective quasi-human based heuristic for solving the rectangle packing problem , 2002, Eur. J. Oper. Res..
[4] Miroslav Chlebík,et al. Hardness of approximation for orthogonal rectangle packing and covering problems , 2009, J. Discrete Algorithms.
[5] Klaus Jansen,et al. Rectangle packing with one-dimensional resource augmentation , 2009, Discret. Optim..
[6] Duanbing Chen,et al. A new heuristic algorithm for rectangle packing , 2007, Comput. Oper. Res..
[7] Duanbing Chen,et al. An efficient heuristic algorithm for rectangle-packing problem , 2007, Simul. Model. Pract. Theory.
[8] Ugur Dogrusöz,et al. Two-dimensional packing algorithms for layout of disconnected graphs , 2002, Inf. Sci..
[9] Vassilios S. Vassiliadis,et al. Two-dimensional stock cutting and rectangle packing: binary tree model representation for local search optimization methods , 2005 .
[10] Jens Egeblad,et al. Translational packing of arbitrary polytopes , 2009, Comput. Geom..
[11] Hiroshi Nagamochi,et al. Exact algorithms for the two-dimensional strip packing problem with and without rotations , 2009, Eur. J. Oper. Res..
[12] Hongfei Teng,et al. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles , 1999, Eur. J. Oper. Res..