An effective quasi-human based heuristic for solving the rectangle packing problem

European Journal of Operational Research

Volumn 141, Issue 2, 2002, Pages 341-358

  Wu, Yu Liang ^a   Huang, Wenqi ^b   Lau, Siu Chung ^a   Wong, C K ^a   Young, Gilbert H ^c  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Two dimensional packing and cutting; VLSI floor planning

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER AIDED DESIGN; COMPUTER SIMULATION; PROBLEM SOLVING; SIMULATED ANNEALING; VLSI CIRCUITS;

PACKING AND CUTTING PROBLEMS;

HEURISTIC METHODS;

EID: 0036722353     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00129-7     Document Type: Article

References (29)

1. An exact two-dimensional non-guillotine cutting tree search procedure
2. Multidimensional binary search trees used for associative searching
3. An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
4. New approaches to nesting rectangular patterns
5. Practical automatic placement for standard-cell integrated circuit
6. VLSI block placement using less flexibility first principles
7. Cutting stock problems and solution procedures
8. An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
9. Approximation schemes for covering and packing problems in image processing and VLSI
10. A quasi-physical method for solving packing problems
11. A quasi-physical method for solving the covering problem - An approach to tackling NP-hard problems
12. A quasi-physical method for solving the three dimensional packing problem
13. Quasi-physical and quasi-social methods for tackling NP-hard problems
14. The quasi-physical and quasi-sociological algorithm solar for solving SAT problem
15. On genetic algorithms for the packing of polygons
16. Optimization by simulated annealing
17. Packing squares into square
18. A mathematic-physical approach to the satisfiability problem
19. Complexity of resource allocation and job scheduling problems in partitionable mesh connected systems
20. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
21. VLSI/PCB placement with obstacles based on sequence pair
22. Geographical data structures compared: A study of data structures supporting region queries
23. An effective quasi-human based heuristic for solving rectangle packing problems
24. A computational improvement to Wang's two-dimensional cutting stock problem
25. Best-first search methods for constrained two-dimensional cutting stock problems
26. Two algorithms for constrained two-dimensional cutting stock problems