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

DOI10.1134/S106423070803012XzbMath1178.90287OpenAlexW2112859283MaRDI QIDQ733985

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

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

Cites Work

• Unnamed Item
• Unnamed Item

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