An exact algorithm for general orthogonal n-dimensional knapsack problems

MaRDI QIDQ4233347zbMATH OpenFDO

Authors Jörg Schepers

Publication date 16 March 1999

zbMATH Keywords

\(n\)-dimensional orthogonal knapsack problemcuttingpackingschedulingtwo-level tree search algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• A new exact algorithm for general orthogonal d-dimensional knapsack problems
• An exact algorithm for general, orthogonal, two-dimensional knapsack problems
• Approximating the Orthogonal Knapsack Problem for Hypercubes
• Exact methods for the knapsack problem and its generalizations
• An exact algorithm for large multiple knapsack problems
• Approximation Algorithms for 3D Orthogonal Knapsack
• scientific article; zbMATH DE number 1183280
• An efficient algorithm for multi-dimensional nonlinear knapsack problems
• An algorithm for solving a class of knapsack problems and its generalization
• An exact algorithm for large unbounded knapsack problems

Cited in

(5)

• An exact algorithm for general, orthogonal, two-dimensional knapsack problems
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem
• scientific article; zbMATH DE number 1183280 (Why is no real title available?)
• A new exact algorithm for general orthogonal d-dimensional knapsack problems

This page was built for publication: An exact algorithm for general orthogonal \(n\)-dimensional knapsack problems

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