Two-dimensional packing with conflicts
type: Item
instance of: scholarly article
title: Two-dimensional packing with conflicts
zbMATH Open document ID: 1144.68051
author: Leah Epstein
author: Asaf Levin
author: Rob van Stee
published in: Acta Informatica
publication date: 2008-06-17T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5288696
MaRDI profile type: Publication
full work available at URL: s00236-007-0067-7
OpenAlex ID: W2077470163
cites work: Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
cites work: Q5501259
cites work: On Packing Two-Dimensional Bins
cites work: Q3347319
cites work: On Bin Packing with Conflicts
cites work: Q5501262
cites work: Geometric algorithms and combinatorial optimization.
cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors
cites work: Precoloring Extension III: Classes of Perfect Graphs
cites work: On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
cites work: An approximation scheme for bin packing with conflicts
cites work: Approximation algorithms for time constrained scheduling
cites work: A near-optimal solution to a two-dimensional cutting stock problem
cites work: Multidimensional cube packing
cites work: A simple on-line bin-packing algorithm
cites work: Q3424784
cites work: On packing of squares and cubes
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: New bounds for multidimensional packing
cites work: Toeplitz Matrices Associated with a Semi-Infinite Laurent Series
cites work: An approximation algorithm for square packing.
DOI: 10.1007/S00236-007-0067-7
description: scientific article; zbMATH DE number 5288696