Improved local search algorithms for the rectangle packing problem with general spatial costs
暂无分享,去创建一个
S. Imahori | M. Yagiura | T. Ibaraki | T. Ibaraki | M. Yagiura | S. Imahori
[1] Sönke Hartmann,et al. Packing problems and project scheduling models: an integrating perspective , 2000, J. Oper. Res. Soc..
[2] R. Gomory,et al. Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .
[3] Bernard Chazelle,et al. The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation , 1983, IEEE Transactions on Computers.
[4] Martin D. F. Wong,et al. Fast evaluation of sequence pair in block placement by longest common subsequence computation , 2000, DATE '00.
[5] Yoji Kajitani,et al. VLSI module placement based on rectangle-packing by the sequence-pair , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[6] Helena Ramalhinho Dias Lourenço,et al. Iterated Local Search , 2001, Handbook of Metaheuristics.
[7] F. Glover,et al. Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.
[8] Toshihide Ibaraki,et al. Local search algorithms for the rectangle packing problem with general spatial costs , 2003, Math. Program..
[9] Martin D. F. Wong,et al. FAST-SP: a fast algorithm for block placement based on sequence pair , 2001, ASP-DAC '01.
[10] Dorit S. Hochbaum,et al. Solving the Convex Cost Integer Dual Network Flow Problem , 2003, Manag. Sci..
[11] Hongfei Teng,et al. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles , 1999, Eur. J. Oper. Res..
[12] Yoji Kajitani,et al. Module placement on BSG-structure and IC layout applications , 1996, ICCAD 1996.
[13] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[14] David S. Johnson,et al. Local Optimization and the Traveling Salesman Problem , 1990, ICALP.
[15] Micha Sharir,et al. Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences , 2015, J. Comb. Theory, Ser. A.
[16] Daniele Vigo,et al. Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems , 1999, INFORMS J. Comput..
[17] Toshihide Ibaraki,et al. Formulation and Tabu Search Algorithm for the Resource Constrained Project Scheduling Problem , 2002 .
[18] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[19] C. Ribeiro,et al. Essays and Surveys in Metaheuristics , 2002, Operations Research/Computer Science Interfaces Series.
[20] Chak-Kuen Wong,et al. An effective quasi-human based heuristic for solving the rectangle packing problem , 2002, Eur. J. Oper. Res..
[21] Harald Dyckhoff,et al. Cutting and Packing in Production and Distribution , 1992 .
[22] Dorit S. Hochbaum,et al. A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem , 2004, Algorithmica.
[23] Andrea Lodi,et al. Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..
[24] E. Hopper,et al. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem , 2001, Eur. J. Oper. Res..