Implementation of parallel branch-and-bound algorithms – experiences with the graph partitioning problem
- 1 May 1991
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 33 (5), 329-349
- https://doi.org/10.1007/bf02073939
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problemOperations Research Letters, 1989
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Load balancing in a network of transputersPublished by Springer Nature ,1988
- A parallel branch and bound algorithm for the quadratic assignment problemDiscrete Applied Mathematics, 1987
- Problème de la bipartition minimale d'un grapheRairo-Operations Research, 1987
- Coping with Anomalies in Parallel Branch-and-Bound AlgorithmsIEEE Transactions on Computers, 1986
- Anomalies in parallel branch-and-bound algorithmsCommunications of the ACM, 1984
- Minimum cuts and related problemsNetworks, 1975
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970