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

Author： Kolpakov R. Posypkin M. Sigal I.

ISSN： 0005-1179

Source： Automation and Remote Control, Vol.71, Iss.10, 2010-10, pp. : 2152-2161

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A parallel branch-and-bound methodfor cluster analysis

By Iyer L.S. Aronson J.E.

Annals of Operations Research, Vol. 90, Iss. 1, 1999-01 ,pp. : 65-86

Springer Publishing Company

Access to resources Recommend Favorite

Parallel branch-and-bound methods for thejob-shop scheduling problem

By Perregaard M. Clausen J.

Annals of Operations Research, Vol. 83, Iss. 1, 1998-01 ,pp. : 137-160

Springer Publishing Company

Access to resources Recommend Favorite

Memory aware load balance strategy on a parallel branch‐and‐bound application

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 27, Iss. 5, 2015-04 ,pp. : 1122-1144

John Wiley & Sons Inc

Access to resources Recommend Favorite

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

By Tomita Etsuji Kameda Toshikatsu

Journal of Global Optimization, Vol. 37, Iss. 1, 2007-01 ,pp. : 95-111

Springer Publishing Company

Access to resources Recommend Favorite

P2P design and implementation of a parallel branch and bound algorithm for grids

By Bendjoudi Ahcene Melab Nouredine Talbi El-Ghazali

International Journal of Grid and Utility Computing, Vol. 1, Iss. 2, 2008-12 ,pp. : 159-168

Inderscience Publishers

Access to resources Recommend Favorite