A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
type: Item
instance of: scholarly article
title: A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
zbMATH Open document ID: 0758.90075
DOI: 10.1007/BF01581188
author: Joseph F. Pekny
author: Donald L. Miller
published in: Mathematical Programming. Series A. Series B
publication date: 1992-10-06T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 68710
zbMATH Keywords: parallel branch-and-bound algorithm
zbMATH Keywords: asymmetric traveling salesman
zbMATH Keywords: lower bounding technique subtour elimination
MaRDI profile type: Publication
cites work: A parallel shortest augmenting path algorithm for the assignment problem
cites work: Q5591849
cites work: Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
cites work: Primal-dual algorithms for the assignment problem
cites work: A note on two problems in connexion with graphs
cites work: An Additive Bounding Procedure for Combinatorial Optimization Problems
cites work: Q3318088
cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
cites work: Q3221759
cites work: Anomalies in parallel branch-and-bound algorithms
cites work: A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions
cites work: Q5187226
cites work: An Algorithm for the Traveling Salesman Problem
cites work: Q3751373
cites work: Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut
cites work: Some Examples of Difficult Traveling Salesman Problems
cites work: Branch-and-bound and parallel computation: A historical note
cites work: Q3777451
cites work: Q3707420
full work available at URL: https://doi.org/10.1007/bf01581188
OpenAlex ID: W1974443370
description: scientific article; zbMATH DE number 68710