An optimal algorithm for rectangle placement
type: Item
instance of: scholarly article
title: An optimal algorithm for rectangle placement
zbMATH Open document ID: 0956.90034
DOI: 10.1016/S0167-6377(98)00048-0
author: Patrick Healy
author: Marcus Creavin
author: Ago Kuusik
published in: Operations Research Letters
publication date: 2001-03-20T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1347070
zbMATH Keywords: rectangle placement
zbMATH Keywords: two-dimensional knapsack
zbMATH Keywords: VLSI layout
MaRDI profile type: Publication
cites work: The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
cites work: Efficient algorithms for the largest rectangle problem
cites work: Some experiments with simulated annealing techniques for packing problems
cites work: A Local Optimization-based Solution to the Rectangle Layout Problem
cites work: A new algorithm for the largest empty rectangle problem
cites work: Q3694703
Wikidata QID: Q127149144
Recommended article: Q5467815
Recommended article: An approximation algorithm for sequential rectangle placement
Recommended article: Optimal placement of rectangles on a plane with fixed objects
Recommended article: Q3981722
Recommended article: Optimal Rectangle Packing: An Absolute Placement Approach
Recommended article: A Local Optimization-based Solution to the Rectangle Layout Problem
Recommended article: Optimal linear arrangement of a rectangular grid
Recommended article: Efficient algorithms for the largest rectangle problem
description: scientific article; zbMATH DE number 1347070