An algorithm and efficient data structures for the binary knapsack problem

DOI10.1016/0377-2217(78)90137-6zbMath0402.90067OpenAlexW2061197582MaRDI QIDQ1255893

Uwe H. Suhl

Publication date: 1978

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(78)90137-6

zbMATH Keywords

Binary Knapsack ProblemBoolean ProgrammingBranch and Bound AlgorithmComputational StudyReduction Scheme

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09)

Related Items (3)

Heuristics and their design: A survey ⋮ A fully polynomial approximation algorithm for the 0-1 knapsack problem ⋮ A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem

Cites Work

• Reduction Algorithm for Zero-One Single Knapsack Problems
• A branch and bound algorithm for the generalized assignment problem
• Resolution of the 0–1 knapsack problem: Comparison of methods
• Merging and Sorting Applied to the Zero-One Knapsack Problem
• Computing Partitions with Applications to the Knapsack Problem
• An Efficient Algorithm for the 0-1 Knapsack Problem
• Approximate Algorithms for the 0/1 Knapsack Problem
• A Direct Descent Binary Knapsack Algorithm
• A Branch Search Algorithm for the Knapsack Problem
• An Enumeration Algorithm for Knapsack Problems
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Mixed-integer Algorithms for the (0,1) Knapsack Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm and efficient data structures for the binary knapsack problem