Approximating the Orthogonal Knapsack Problem for Hypercubes

DOI10.1007/11786986_22MaRDI QIDQ3613763zbMATH OpenOpenAlexFDO

Authors Rolf Harren

Publication date 12 March 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11786986_22

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• Approximation algorithms for orthogonal packing problems for hypercubes
• Approximation Algorithms for 3D Orthogonal Knapsack
• Multidimensional cube packing
• Multidimensional cube packing
• Approximation schemes for multidimensional packing

Cited in

(7)

• Approximation algorithms for orthogonal packing problems for hypercubes
• MPQ-trees for orthogonal packing problem
• A Polynomial Time Approximation Scheme for the Square Packing Problem
• scientific article; zbMATH DE number 1264415 (Why is no real title available?)
• Approximation Algorithms for 3D Orthogonal Knapsack
• A new exact algorithm for general orthogonal d-dimensional knapsack problems
• Rectangle packing with one-dimensional resource augmentation

This page was built for publication: Approximating the Orthogonal Knapsack Problem for Hypercubes

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