Approximation Algorithms for 3D Orthogonal Knapsack

DOI10.1007/978-3-540-72504-6_3zbMath1198.68299OpenAlexW2155767203MaRDI QIDQ5425418

Henning Thomas, Florian Diedrich, Ralf Thöle, Rolf Harren, Klaus Jansen

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_3

zbMATH Keywords

computational complexitystructural complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Approximation algorithms for orthogonal packing problems for hypercubes

Uses Software

• Knapsack

This page was built for publication: Approximation Algorithms for 3D Orthogonal Knapsack