Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem

DOI10.1134/S106423071105011XzbMath1268.90131OpenAlexW2134343603MaRDI QIDQ353698

Roman M. Kolpakov, Mikhail A. Posypkin

Publication date: 16 July 2013

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

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

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (1)

The scalability analysis of a parallel tree search algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions
• Optimization of schedules with precedence logical conditions

This page was built for publication: Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem