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

DOI10.1007/S43069-024-00372-2MaRDI QIDQ6633256zbMATH OpenFDO

Authors Evgenii P. Burashnikov

Publication date 5 November 2024

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

Full work available at URL https://doi.org/10.1007/S43069-024-00372-2

zbMATH Keywords

branch-and-boundcombinatorial optimizationdynamic programmingknapsack 0-1 problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 432989
• Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems
• Dynamic programming revisited: Improving knapsack algorithms
• scientific article; zbMATH DE number 1302173
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Cites work

• A branch and bound algorithm for the generalized assignment problem
• A fuzzy DEA and knapsack formulation integrated model for project selection
• An Efficient Algorithm for the 0-1 Knapsack Problem
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• Discrete dynamic programming and capital allocation
• Discrete-variable extremum problems
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Heuristics for the container loading problem
• Hiding information and signatures in trapdoor knapsacks
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• New trends in exact algorithms for the \(0-1\) knapsack problem
• The theory of dynamic programming

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

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