LATIN 2004: Theoretical Informatics
From MaRDI portal
Publication:5901656
DOI10.1007/b95852zbMath1196.90105OpenAlexW2475444492MaRDI QIDQ5901656
Flávio K. Miyazawa, Yoshiko Wakabayashi
Publication date: 7 May 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95852
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items
Approximation and online algorithms for multidimensional bin packing: a survey ⋮ A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing ⋮ A hybrid placement strategy for the three-dimensional strip packing problem ⋮ Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation ⋮ A Tight (3/2+ε) Approximation for Skewed Strip Packing. ⋮ Three-dimensional packings with rotations ⋮ Hardness of approximation for orthogonal rectangle packing and covering problems ⋮ Unnamed Item ⋮ Resource augmentation in two-dimensional packing with orthogonal rotations
