Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems
DOI10.1134/S106423070803012XzbMATH Open1178.90287OpenAlexW2112859283MaRDI QIDQ733985FDOQ733985
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
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Dynamic programming (90C39)
Cites Work
Cited In (4)
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)
