An optimal algorithm for rectangle placement

DOI10.1016/S0167-6377(98)00048-0zbMath0956.90034WikidataQ127149144 ScholiaQ127149144MaRDI QIDQ1306372

Ago Kuusik, Marcus Creavin, Patrick Healy

Publication date: 20 March 2001

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

rectangle placementVLSI layouttwo-dimensional knapsack

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Related Items

A population heuristic for constrained two-dimensional non-guillotine cutting ⋮ Generating optimal T-shape cutting patterns for circular blanks ⋮ A hybrid genetic algorithm for the two-dimensional single large object placement problem ⋮ A tabu search algorithm for a two-dimensional non-guillotine cutting problem ⋮ Space defragmentation for packing problems ⋮ A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects ⋮ A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP ⋮ A fast implementation for the 2D/3D box placement problem ⋮ Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors

Cites Work

• Unnamed Item
• A new algorithm for the largest empty rectangle problem
• Efficient algorithms for the largest rectangle problem
• Some experiments with simulated annealing techniques for packing problems
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• A Local Optimization-based Solution to the Rectangle Layout Problem

This page was built for publication: An optimal algorithm for rectangle placement