A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM

DOI10.1142/S0217595907001334zbMath1172.90470MaRDI QIDQ3503066

Wenqi Huang, Duan-bing Chen

Publication date: 20 May 2008

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristic algorithmcorner-occupying actionnon-guillotineconstrained rectangle-packing problemlayout value

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem

Cites Work

• An exact algorithm for general, orthogonal, two-dimensional knapsack problems
• On the two-dimensional knapsack problem
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• An effective quasi-human based heuristic for solving the rectangle packing problem
• A population heuristic for constrained two-dimensional non-guillotine cutting
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• An Algorithm for Two-Dimensional Cutting Problems
• A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
• New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing