Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem

Authors:
D. L. Miller;J. F. Pekny
Affiliations:
Engineering Design Research Center, Carnegie Mellon University, Pittsburgh, PA 15213, USA;Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA 15213, USA
Venue:
Operations Research Letters
Year:
1989

Citing 6
Cited 3

Contention is no obstacle to shared-memory multiprocessing

Communications of the ACM - Special issue on parallelism
A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functions

Information Processing Letters
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems

Mathematical Programming: Series A and B
Anomalies in parallel branch-and-bound algorithms

Communications of the ACM
Solution of large dense transportation problems using a parallel primal algorithm

Operations Research Letters
Branch-and-bound and parallel computation: A historical note

Operations Research Letters

A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem

Engineering Applications of Artificial Intelligence
Experiments with parallel branch-and-bound algorithms for the set covering problem

Operations Research Letters
Solution of large dense transportation problems using a parallel primal algorithm

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computational results are presented for a parallel branch and bound algorithm that optimally solves the asymmetric traveling salesman problem. The algorithm uses an assignment problem based lower bounding technique, subtour elimination branching rules, and a subtour patching algorithm as an upper bounding procedure. Results are presented for randomly generated problems with sizes ranging from 50 to 3000 cities.