Approximation Algorithms for 3D Orthogonal Knapsack

DOI10.1007/978-3-540-72504-6_3MaRDI QIDQ5425418zbMATH OpenOpenAlexFDO

Authors Florian Diedrich, Rolf Harren, Ralf Thöle, Henning Thomas, 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) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• Three-dimensional packings with rotations
• LATIN 2004: Theoretical Informatics
• Approximation algorithms for orthogonal packing problems for hypercubes
• Approximating the Orthogonal Knapsack Problem for Hypercubes
• Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem

Cited in

(9)

• Three-dimensional packings with rotations
• Approximation algorithms for orthogonal packing problems for hypercubes
• Approximating the 3-period incremental knapsack problem
• Approximation and online algorithms for multidimensional bin packing: a survey
• Approximating the Orthogonal Knapsack Problem for Hypercubes
• scientific article; zbMATH DE number 1264415 (Why is no real title available?)
• Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
• A new exact algorithm for general orthogonal d-dimensional knapsack problems
• Heuristic approaches for the two- and three-dimensional knapsack packing problem

Describes a project that uses

Uses Software

• Knapsack

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425418)