The travelling salesman problem: selected algorithms and heuristics†

DOI10.1080/0020739890200605zbMath0691.90066OpenAlexW1971784724MaRDI QIDQ3033569

Diane M. Spresser

Publication date: 1989

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

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

zbMATH Keywords

heuristicstravelling salesmannearest neighbourworst case behaviournearest addition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Dynamic programming (90C39)

Cites Work

• Analysis of a data matrix and a graph: metagenomic data and the phylogenetic tree
• The art and theory of dynamic programming
• A Dynamic Programming Approach to Sequencing Problems
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• The Traveling Salesman Problem: A Survey
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The travelling salesman problem: selected algorithms and heuristics†