Abstract
The d-dimensional orthogonal knapsack problem (OKP) has a wide range of practical applications, including packing, cutting, and scheduling. We present a new approach to this problem, using a graphtheoretical characterization of feasible packings. This characterization allows us to deal with classes of packings that share a certain combinatorical structure, instead of single ones. Combining the use of this structure with other heuristics, we develop a two-level tree search algorithm for finding exact solutions for the d-dimensional OKP. Computational results are reported, including optimal solutions for all two-dimensional test problems from recent literature.
Cite
CITATION STYLE
Fekete, S. P., & Schepers, J. (1997). A new exact algorithm for general orthogonal D-dimensional knapsack problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1284, pp. 144–156). Springer Verlag. https://doi.org/10.1007/3-540-63397-9_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
