✦ LIBER ✦

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

✍ Scribed by M. A. Posypkin; I. Kh. Sigal

Book ID: 110194664
Publisher: SP MAIK Nauka/Interperiodica
Year: 2006
Tongue: English
Weight: 269 KB
Volume: 46
Category: Article
ISSN: 0965-5425
DOI: 10.1134/s0965542506120165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for the speedup of parall

An upper bound for the speedup of parallel best-bound branch-and-bound algorithms

✍ Michael J. Quinn; Narsingh Deo 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 586 KB

Application of parallel heuristic algori

Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method

✍ M. A. Posypkin; I. Kh. Sigal 📂 Article 📅 2007 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 362 KB

Estimating the computational complexity

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

✍ R. M. Kolpakov; M. A. Posypkin 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 456 KB

Effect of the selection of branch variab

Effect of the selection of branch variables in parallel branch and bound method

✍ Katsumi Onishi; Hiroyuki Ebara; Hideo Nakano 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 522 KB

The branch and bound method is a solution method which is used in deriving the optimal solution for combinatorial optimization problems. The parallel implementation of the branch and bound method is considered, aiming at expansion of the range of applicable problems. With recent advances in PCs and

On a lower bound on the computational co

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

✍ R. M. Kolpakov; M. A. Posypkin; I. Kh. Sigal 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 147 KB

Application of the branch and bound meth

Application of the branch and bound method to some discrete programming problems

✍ I.G. Mitev 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 464 KB