A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem

Publisher Website

1 November 1979

journal article
Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing

Vol. 8 (4), 561-573
https://doi.org/10.1137/0208045

Abstract

No abstract available

Keywords

This publication has 6 references indexed in Scilit:

On the Expected Value of a Random Assignment Problem
SIAM Journal on Computing, 1979
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM, 1972
Reducibility among Combinatorial Problems
Published by Springer Nature ,1972
On some techniques useful for solution of transportation network problems
Networks, 1971
Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
Operations Research, 1964
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
The Annals of Mathematical Statistics, 1952

Cited by 119 articles