Two-dimensional packing with conflicts
From MaRDI portal
Publication:929297
DOI10.1007/s00236-007-0067-7zbMath1144.68051OpenAlexW2077470163MaRDI QIDQ929297
Asaf Levin, Leah Epstein, Rob van Stee
Publication date: 17 June 2008
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-007-0067-7
Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (3)
A hybrid algorithm for constrained order packing ⋮ Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem ⋮ Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for time constrained scheduling
- An approximation algorithm for square packing.
- Geometric algorithms and combinatorial optimization.
- New bounds for multidimensional packing
- Multidimensional cube packing
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- An approximation scheme for bin packing with conflicts
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- 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
- A simple on-line bin-packing algorithm
- On Packing Two-Dimensional Bins
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Precoloring Extension III: Classes of Perfect Graphs
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- On Bin Packing with Conflicts
- On packing of squares and cubes
- Toeplitz Matrices Associated with a Semi-Infinite Laurent Series
This page was built for publication: Two-dimensional packing with conflicts
