A parallel branch-and-bound methodfor cluster analysis

ISSN： 0254-5330

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

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

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

By Kolpakov R. Posypkin M. Sigal I.

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

MAIK Nauka/Interperiodica

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

A Branch-and-Bound Algorithm for Concave Network Flow Problems

By Fontes Dalila Hadjiconstantinou Eleni Christofides Nicos

Journal of Global Optimization, Vol. 34, Iss. 1, 2006-01 ,pp. : 127-155

Springer Publishing Company

Access to resources Recommend Favorite

A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking

By Ronconi Débora

Annals of Operations Research, Vol. 138, Iss. 1, 2005-09 ,pp. : 53-65

Springer Publishing Company

Access to resources Recommend Favorite