An effective quasi-human based heuristic for solving the rectangle packing problem
type: Item
instance of: scholarly article
title: An effective quasi-human based heuristic for solving the rectangle packing problem
zbMATH Open document ID: 1081.90615
DOI: 10.1016/S0377-2217(02)00129-7
author: Wenqi Huang
author: S.-C. Lau
author: C. K. Wong
author: Gilbert H. Young
author: Yu-Liang Wu
published in: European Journal of Operational Research
publication date: 2002-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1829902
zbMATH Keywords: Two-dimensional packing and cutting
zbMATH Keywords: VLSI floor planning
MaRDI profile type: Publication
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: Multidimensional binary search trees used for associative searching
cites work: An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
cites work: Practical Automatic Placement for Standard-Cell Integrated Circuits
cites work: `` Strong '' NP-Completeness Results
cites work: Cutting stock problems and solution procedures
cites work: An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: Q3753399
cites work: On genetic algorithms for the packing of polygons
cites work: Optimization by Simulated Annealing
cites work: A mathematic-physical approach to the satisfiability problem
cites work: An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
cites work: Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
cites work: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
full work available at URL: s0377-2217(02)00129-7
OpenAlex ID: W1966217755
description: scientific article; zbMATH DE number 1829902