A recursive branch and bound algorithm for the multidimensional knapsack problem

DOI10.1002/nav.3800220210zbMath0307.90054OpenAlexW1986013254MaRDI QIDQ4065286

Arne Thesen

Publication date: 1975

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800220210

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (5)

Admission control in computer networks with uncertain parameters ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Parametric nonlinear integer programming: The right-hand side case ⋮ Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects

Cites Work

• A technique for generating interpretive translators for problem-oriented languages

This page was built for publication: A recursive branch and bound algorithm for the multidimensional knapsack problem