Computational results with a branch-and-bound algorithm for the general knapsack problem

DOI10.1002/NAV.3800260105MaRDI QIDQ4180138zbMATH OpenOpenAlexFDO

Authors

Publication date 1979

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

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

zbMATH Keywords

Branch-And-Bound AlgorithmComputational StudyGeneral Knapsack Problem

Mathematics Subject Classification ID

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

Cited in

(5)

• A new enumeration scheme for the knapsack problem
• The knapsack problem with generalized upper bounds
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• A heuristic approach to the lumber allocation problem in hardwood dimension and furniture manufacturing
• A solution procedure for general knapsack problems with a few constraints

This page was built for publication: Computational results with a branch-and-bound algorithm for the general knapsack problem

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