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

Authors:
J. F. Pekny;D. L. Miller
Affiliations:
-;-
Venue:
Mathematical Programming: Series A and B
Year:
1992

Citing 0
Cited 4

Exact solution of large-scale, asymmetric traveling salesman problems

ACM Transactions on Mathematical Software (TOMS)
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs

Discrete Applied Mathematics
A note on exploiting the Hamiltonian cycle problem substructure of the Asymmetric Traveling Salesman Problem

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

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract