Online removable square packing
From MaRDI portal
Publication:927402
DOI10.1007/S00224-007-9039-0zbMath1135.90434OpenAlexW2048830603MaRDI QIDQ927402
Xin Han, Kazuo Iwama, Guo-Chuan Zhang
Publication date: 6 June 2008
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9039-0
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items (12)
Improved Bound for Online Square-into-Square Packing ⋮ Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing ⋮ 2D knapsack: packing squares ⋮ On-line Packing Cubes into $n$ Unit Cubes ⋮ The online knapsack problem: advice and randomization ⋮ On-line algorithms for 2-space bounded 2-dimensional bin packing ⋮ Online packing of \(d\)-dimensional boxes into the unit cube ⋮ 2D Knapsack: Packing Squares ⋮ Online square-into-square packing ⋮ On-line packing and covering a disk with disks ⋮ ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING ⋮ A note on one-space bounded square packing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On-line packing sequences of cubes in the unit cube
- New bounds for multidimensional packing
- On the two-dimensional knapsack problem
- Multidimensional cube packing
- Online square and cube packing
- New Algorithms for Bin Packing
- Automata, Languages and Programming
- Mathematical Foundations of Computer Science 2005
- On packing of squares and cubes
This page was built for publication: Online removable square packing