On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method

DOI10.1134/S0005117910100140zbMath1243.90249MaRDI QIDQ612225

I. Kh. Sigal, Roman M. Kolpakov, Mikhail A. Posypkin

Publication date: 3 January 2011

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

parallel complexityBoolean knapsack problembranch-and-bound method for optimization problemsparallel complexity independent

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
• Unnamed Item
• Unnamed Item

This page was built for publication: On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method