Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems

DOI10.1080/01966324.1984.10737137zbMath0552.90070OpenAlexW2091820560WikidataQ58249322 ScholiaQ58249322MaRDI QIDQ3346092

Richard A. Hall, James R. Evans

Publication date: 1984

Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01966324.1984.10737137

zbMATH Keywords

traveling salesman problemasymmetric caseprobabilistic frameworkassignment ranking techniques

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (1)

Heuristic methods and applications: A categorized survey

Cites Work

• Probabilistic analysis of solving the assignment problem for the traveling salesman problem
• A versatile scheme for ranking the extreme points of an assignment polytope
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• An Algorithm for the Traveling Salesman Problem
• The Traveling Salesman Problem: A Survey
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost

This page was built for publication: Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems