An optimal algorithm for rectangle placement

DOI10.1016/S0167-6377(98)00048-0zbMATH Open0956.90034WikidataQ127149144 ScholiaQ127149144MaRDI QIDQ1306372FDOQ1306372

Authors: Patrick Healy, Marcus Creavin, Ago Kuusik 

Publication date: 20 March 2001

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

Recommendations

• Algorithms for the solution of the problem of placing rectangles in a rectangular area
• An approximation algorithm for sequential rectangle placement
• Optimal placement of rectangles on a plane with fixed objects
• scientific article; zbMATH DE number 22188
• Optimal rectangle packing: an absolute placement approach
• A Local Optimization-based Solution to the Rectangle Layout Problem
• Optimal linear arrangement of a rectangular grid
• Efficient algorithms for the largest rectangle problem

zbMATH Keywords

VLSI layouttwo-dimensional knapsackrectangle placement

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Some experiments with simulated annealing techniques for packing problems
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• A new algorithm for the largest empty rectangle problem
• Efficient algorithms for the largest rectangle problem
• A Local Optimization-based Solution to the Rectangle Layout Problem

Cited In (29)

• A fast implementation for the 2D/3D box placement problem
• On the approximability of orthogonal order preserving layout adjustment
• An algorithm for polygon placement using a bottom-left strategy
• Optimal rectangle packing: an absolute placement approach
• A Local Optimization-based Solution to the Rectangle Layout Problem
• Title not available (Why is that?)
• An approximation algorithm for sequential rectangle placement
• Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
• Performance Bound for Bottom-Left Guillotine Packing of Rectangles
• An optimum placement search algorithm based on extended corner block list.
• A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
• An exact rectangular two-segment layout algorithm with optimal same-shape strip generation
• A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
• An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
• Optimal placement of rectangles on a plane with fixed objects
• A population heuristic for constrained two-dimensional non-guillotine cutting
• Space defragmentation for packing problems
• Packing solar cells on a roof
• Generating optimal T-shape cutting patterns for circular blanks
• Few sequence pairs suffice: representing all rectangle placements
• Efficient algorithms for the largest rectangle problem
• Effect of corner information in simultaneous placement of \(K\) rectangles and tableaux
• Effect of corner information in simultaneous placement of \(k\) rectangles and tableaux
• Title not available (Why is that?)
• Algorithms for the solution of the problem of placing rectangles in a rectangular area
• Enumerating bottom-left stable positions for rectangle placements with overlap
• 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
• Estimation of distribution algorithm for two dimensional placement problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306372)