Best-first branch-and bound on a hypercube

Authors:
E. W. Felten
Affiliations:
Caltech Concurrent Computation Program, California Institute of Technology, 206-49, Pasadena, CA
Venue:
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Year:
1989

Citing 3
Cited 4

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
On the stability of the travelling salesman problem algorithm of Hopfield and Tank

Biological Cybernetics
Chess on a hypercube

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2

What have we learnt from using real parallel machines to solve real problems?

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
“Topologies”—distributed objects on multicomputers

ACM Transactions on Computer Systems (TOCS)
Distributed Shared Abstractions (DSA) on Multiprocessors

IEEE Transactions on Software Engineering
A Case Study of Load Distribution in Parallel View Frustum Culling and Collision Detection

Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The branch-and-bound technique is a common method for finding exact solutions to difficult problems in combinatorial optimization. This paper will discuss issues surrounding implementation of a particular branch-and-bound algorithm for the traveling-salesman problem on a hypercube multi-computer.The natural parallel algorithm is based on a number of asynchronous processes which interact through a globally shared list of unfinished work. In a distributed-memory environment we must find a non-centralized version of this shared data structure. In addition, detecting termination of the computation is tricky; an algorithm will be presented which ensures proper termination. Finally, issues affecting performance will be discussed.