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

DOI10.1002/nav.3800260105zbMath0396.90064OpenAlexW2141742819MaRDI QIDQ4180138

No author found.

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

Computational StudyBranch-And-Bound AlgorithmGeneral Knapsack Problem

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item