A new heuristic algorithm for rectangle packing
暂无分享,去创建一个
[1] Martin D. F. Wong,et al. FAST-SP: a fast algorithm for block placement based on sequence pair , 2001, ASP-DAC '01.
[2] Chak-Kuen Wong,et al. An effective quasi-human based heuristic for solving the rectangle packing problem , 2002, Eur. J. Oper. Res..
[3] E. Hopper,et al. A genetic algorithm for a 2D industrial packing problem , 1999 .
[4] Yao-Wen Chang,et al. Corner sequence - a P-admissible floorplan representation with a worst case linear-time packing scheme , 2003, IEEE Trans. Very Large Scale Integr. Syst..
[5] Takeshi Yoshimura,et al. An enhanced perturbing algorithm for floorplan design using the O-tree representation , 2000, ISPD '00.
[6] Takeshi Yoshimura,et al. An O-tree representation of non-slicing floorplan and its applications , 1999, DAC '99.
[7] Yao-Wen Chang,et al. TCG: a transitive closure graph-based representation for non-slicing floorplans , 2001, DAC '01.
[8] Yici Cai,et al. Stairway compaction using corner block list and its applications with rectilinear blocks , 2002, Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design.
[9] Yoji Kajitani,et al. Module placement on BSG-structure and IC layout applications , 1996, ICCAD 1996.
[10] Yao-Wen Chang,et al. TCG-S: orthogonal coupling of P/sup */-admissible representations for general floorplans , 2002, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[11] Wenqi Huang,et al. Two personification strategies for solving circles packing problem , 1999 .
[12] Yoji Kajitani,et al. VLSI module placement based on rectangle-packing by the sequence-pair , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[13] Sándor P. Fekete,et al. An Exact Algorithm for Higher-Dimensional Orthogonal Packing , 2006, Oper. Res..
[14] E. Hopper,et al. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem , 2001, Eur. J. Oper. Res..
[15] Yao-Wen Chang,et al. B*-trees: a new representation for non-slicing floorplans , 2000, Proceedings 37th Design Automation Conference.
[16] Yici Cai,et al. Corner block list: an effective and efficient topological representation of non-slicing floorplan , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).
[17] Yoji Kajitani,et al. Module placement on BSG-structure and IC layout applications , 1996, Proceedings of International Conference on Computer Aided Design.
[18] Chin-Sheng Chen,et al. An analytical model for the container loading problem , 1995 .
[19] David Pisinger,et al. The two-dimensional bin packing problem with variable bin sizes and costs , 2005, Discret. Optim..
[20] Wenqi Huang,et al. Quasiphysical and quasisociological algorithm Solar for solving SAT problem , 1999 .
[21] Yao-Wen Chang,et al. TCG-S: orthogonal coupling of P*-admissible representations for general floorplans , 2004, Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324).