Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems

DOI10.1134/S106423070803012XMaRDI QIDQ733985zbMATH OpenOpenAlexFDO

Authors N. N. Galim'yanova

Publication date 19 October 2009

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s106423070803012x

Mathematics Subject Classification ID

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

Recommendations

• A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
• scientific article; zbMATH DE number 4093178
• A branch-and-bound algorithm for hard multiple knapsack problems
• The efficiency enhanced branch and bound algorithm for the knapsack model
• A branch and bound algorithm for solving the multiple-choice knapsack problem
• scientific article; zbMATH DE number 1149800
• Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems

Cites work

• scientific article; zbMATH DE number 766286 (Why is no real title available?)
• Investigation of algorithms of parallel computations in knapsack-type discrete optimization problems

Cited in

(6)

• An efficient algorithm of dead-end controls for solving combinatorial optimization problems
• Experiments with the ``Oregon Trail knapsack problem
• scientific article; zbMATH DE number 432989 (Why is no real title available?)
• The efficiency enhanced branch and bound algorithm for the knapsack model
• Branch-and-bound and dynamic programming approaches for the knapsack problem
• A combined parallel algorithm for solving the knapsack problem

This page was built for publication: Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems

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