✦ LIBER ✦

Hierarchical branch and bound algorithm for computational grids

✍ Scribed by A. Bendjoudi; N. Melab; E.-G. Talbi

Book ID: 116497186
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 622 KB
Volume: 28
Category: Article
ISSN: 0167-739X
DOI: 10.1016/j.future.2012.03.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient load balancing strategy for

An efficient load balancing strategy for grid-based branch and bound algorithm

✍ M. Mezmaz; N. Melab; E.-G. Talbi 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 286 KB

The most popular parallelization approach of the branch and bound algorithm consists in building and exploring in parallel the search tree representing the problem being tackled. The deployment of such parallel model on a grid rises the crucial issue of dynamic load balancing. The major question is

Computational aspects of a branch and bo

Computational aspects of a branch and bound algorithm for quadratic zero-one programming

✍ P. M. Pardalos; G. P. Rodgers 📂 Article 📅 1990 🏛 Springer Vienna 🌐 English ⚖ 712 KB

Computational results with a branch-and-

Computational results with a branch-and-bound algorithm for the general knapsack problem

✍ R. L. Bulfin; R. G. Parker; C. M. Shetty 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB 👁 1 views

A Branch and Bound Algorithm for Computi

A Branch and Bound Algorithm for Computing k-Nearest Neighbors

✍ Fukunaga, K.; Narendra, P.M. 📂 Article 📅 1975 🏛 IEEE 🌐 English ⚖ 887 KB

An efficient branch-and-bound algorithm

An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments

✍ Etsuji Tomita; Toshikatsu Kameda 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 95 KB

An Efficient Branch-and-bound Algorithm

An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments

✍ Etsuji Tomita; Toshikatsu Kameda 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 227 KB