Branch-and-bound and dynamic programming approaches for the knapsack problem

DOI10.1007/s43069-024-00372-2MaRDI QIDQ6633256

Evgenii P. Burashnikov

Publication date: 5 November 2024

Published in: SN Operations Research Forum (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingcombinatorial optimizationbranch-and-boundknapsack 0-1 problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• New trends in exact algorithms for the \(0-1\) knapsack problem
• A fuzzy DEA and knapsack formulation integrated model for project selection
• Heuristics for the container loading problem
• Discrete Dynamic Programming and Capital Allocation
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• A branch and bound algorithm for the generalized assignment problem
• An Efficient Algorithm for the 0-1 Knapsack Problem
• Discrete-Variable Extremum Problems
• The theory of dynamic programming
• Hiding information and signatures in trapdoor knapsacks

This page was built for publication: Branch-and-bound and dynamic programming approaches for the knapsack problem