Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
From MaRDI portal
Publication:3586262
DOI10.1515/DMA.2010.006zbMath1198.90338MaRDI QIDQ3586262
Mikhail A. Posypkin, Roman M. Kolpakov
Publication date: 6 September 2010
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items (6)
Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method ⋮ Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering ⋮ Optimal strategy for solving a special case of the knapsack problem by the branch and bound method ⋮ Boundary layers in fibrous composite materials ⋮ On the best choice of a branching variable in the subset sum problem ⋮ The scalability analysis of a parallel tree search algorithm
Cites Work
This page was built for publication: Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem