A recursive branch and bound algorithm for the multidimensional knapsack problem

DOI10.1002/NAV.3800220210MaRDI QIDQ4065286zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(6)

• Parametric nonlinear integer programming: The right-hand side case
• The multidimensional 0-1 knapsack problem: an overview.
• Problem reduction heuristic for the 0-1 multidimensional knapsack problem
• Admission control in computer networks with uncertain parameters
• A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects

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

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