An algorithm for solving a class of knapsack problems and its generalization
From MaRDI portal
Publication:558641
zbMath1095.90090MaRDI QIDQ558641
Publication date: 4 July 2005
Published in: Computer Science Journal of Moldova (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
This page was built for publication: An algorithm for solving a class of knapsack problems and its generalization