Pyramidal traveling salesman problem

In this paper, we give new polynomially testable sufficiency conditions for a given instance of the traveling salesman problem (TSP) to have an optimal tour that is pyramidal. This properly generalizes the Demidenko condition and the conditions of Warren. We thus have new, nontrivial polynomially te...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & operations research 1999-04, Vol.26 (4), p.353-369
Hauptverfasser:	Fazle Baki, Md, Kabadi, Santosh N.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Exact sciences and technology Flows in networks. Combinatorial problems Operational research and scientific management Operational research. Management science Operations research Polynomial algorithm Pyramidal tour Studies Traveling salesman problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!