Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem

An O( n 3 ) heuristic algorithm is described for solving d -city travelling salesman problems (TSP) whose cost matrix satisfies the triangularity condition. The algorithm involves as substeps the computation of a shortest spanning tree of the graph G defining the TSP and the finding of a minimum cos...

Celý popis

Podrobná bibliografia

Vydané v:	Operations Research Forum Ročník 3; číslo 1; s. 20
Hlavný autor:	Christofides, Nicos
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.03.2022 Springer Nature B.V
Predmet:	Algorithms Applications of Mathematics Business and Management Graph coloring Graph theory Heuristic Heuristic methods Math Applications in Computer Science Mathematical and Computational Engineering Minimum cost Operations Research/Decision Theory Optimization Original Research Polynomials Traveling salesman problem
ISSN:	2662-2556, 2662-2556
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!