Probabilistic analysis of solving the assignment problem for the traveling salesman problem
type: Item
instance of: scholarly article
title: Probabilistic analysis of solving the assignment problem for the traveling salesman problem
zbMATH Open document ID: 0471.90087
DOI: 10.1016/0377-2217(82)90014-5
author: J.-C. Panayiotopoulos
published in: European Journal of Operational Research
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3739314
zbMATH Keywords: probabilistic analysis
zbMATH Keywords: optimal solutions
zbMATH Keywords: asymmetric traveling salesman
zbMATH Keywords: assignment problem
zbMATH Keywords: random data
zbMATH Keywords: branch-and-bound methods
MaRDI profile type: Publication
full work available at URL: 0377-2217(82)90014-5
OpenAlex ID: W1968577698
cites work: Dynamic Programming Treatment of the Travelling Salesman Problem
cites work: The Traveling Salesman Problem: A Survey
cites work: Q4155835
cites work: A statistical approach to the tsp
cites work: Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
cites work: A Dynamic Programming Approach to Sequencing Problems
cites work: Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
cites work: Q4142699
cites work: Branch-and-Bound Methods: A Survey
cites work: An Algorithm for the Traveling Salesman Problem
cites work: Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
description: scientific article; zbMATH DE number 3739314