Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
Analysis and Implementation of Branch-and-Bound Algorithms on a Hypercube Multicomputer
IEEE Transactions on Computers
Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
Annals of Operations Research
Advances in parallel algorithms
Control strategies for parallel mixed integer branch and bound
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Load Balancing for Distributed Branch and Bound Algorithms
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Two Strategies for Solving the Vertex Cover Problem on a Transputer Network
Proceedings of the 3rd International Workshop on Distributed Algorithms
A Parallel Formulatiion for General Branch-and-Bound Algorithms
IRREGULAR '95 Proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems
A generalized utility for parallel branch and bound algorithms
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Experiments with a new selection criterion in a fast interval optimization algorithm
Journal of Global Optimization
Interrupt and Cancellation as Synchronization Methods
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Branch, Cut, and Price: Sequential and Parallel
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
An exact algorithm for the maximum leaf spanning tree problem
Computers and Operations Research
Solving the Maximum Clique Problem using PUBB
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Parallel Branch-and-Bound Algorithm for Constructing Evolutionary Trees from Distance Matrix
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
A grid-aware MIP solver: Implementation and case studies
Future Generation Computer Systems
Computational experience with branch, cut and price algorithms in grid environments
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
A grid-aware branch, cut and price implementation
PVM/MPI'05 Proceedings of the 12th European PVM/MPI users' group conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Performance analysis of Branch-and-Bound skeletons
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these algorithms. Parallel branch-and- bound algorithm implementations can be divided in two types based on whether a central or a distributed control scheme is used. Central control schemes have reduced scalability because of bottleneck problems frequently encountered. In order to solve problem cases that cannot be solved with sequential branch-and-bound algorithm, distributed control schemes are necessary. However, compared to central control schemes, higher efficiency is not always achieved through the use of a distributed control scheme. In this paper, a mixed control scheme is proposed, changing between the two different types of control schemes during execution. In addition, a dynamic load balancing strategy is applied in the distributed control scheme. Performance evaluation for three different cases is carried out: central, distributed, and mixed control scheme. Several TSP instances from the TSPLIB are experimentally solved, using up to 101 workstations. The results of these experiments show that the mixed control scheme is one of the most promising control schemes and furthermore, the hybrid selection rule, which was introduced in our previous work, has an advantage in parallel branch-and-bound algorithms.