Results 231 to 240 of about 178,189 (288)

Parallel branch and bound algorithms- an overview

, 1989
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Performance of parallel branch-and-bound algorithms

IEEE Transactions on Computers, 1985
We study the performance of parallel best-bound-first branch-and-bound algorithms, in which several nodes with least lower bounds are expanded simultaneously. It is well known that anomalies may occur in the execution of a parallel branch-and-bound algorithm.
Lai, Ten-Hwang, Sprague, Alan
openaire   +3 more sources

A Branch and Bound Clustering Algorithm

IEEE Transactions on Computers, 1975
The problem of clustering N objects into M classes may be viewed as a combinatorial optimization algorithm. In the literature on clustering, iterative hill-climbing techniques are used to find a locally optimum classification. In this paper, we develop a clustering algorithm based on the branch and bound method of combinatorial optimization.
Koontz, Warren L. G., Narendra, Patrenahalli M., Fukunaga, Keinosuke   +2 more
openaire   +2 more sources

Parallel branch-and-bound algorithms

Future Generation Computer Systems, 1989
Abstract In this paper a parallel algorithm for branch-and-bound problems is sketched. It is designed to run on MIMD machines and exploits coarse grain parallelism. Due to the irregular and unpredictable behavior of branch-and-bound algorithms, it is hard to obtain a good load-balance.
J.M. Jansen, F.W. Sijstermans
openaire   +1 more source

Embedding Branch and Bound within Evolutionary Algorithms

Applied Intelligence, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cotta, Carlos, Troya, José M.
openaire   +2 more sources

A Branch-and-Bound Algorithm for Pagination

Operations Research, 1975
The paper presents an algorithm for partitioning the nodes of a weighted graph in order to minimize the interset weights. The algorithm is patterned after the branch-and-probabilistic-bound procedures of Graves and Whinston. Final partitions or solutions are characterized by probability statements like: “the probability is greater than α that a ...
Duncan, John, Scott, Lawrence W.
openaire   +1 more source