Geodesic
An algorithm for the solution of the traveling salesman problem via disjunctive graphs
Mathematica Applicanda, Tome 6 (1978) no. 13, pp. 81-98.

Voir la notice de l'article provenant de la source Annales Societatis Mathematicae Polonae Series

From the introduction: "The traveling salesman problem is a problem of combinatorial type. Although problems of this type sometimes have a relatively simple formulation, there are many difficulties associated with their solution even when the most up-to-date computers are used. In the 1970s many papers have been devoted to this problem. The purpose of the vast majority of them has been to find more effective solution algorithms. "In this paper we give the solution of the traveling salesman problem via disjunctive graphs. Up to now the elements of disjunctive graphs have been used to solve problems connected with the determination of an optimal task completion sequence.''
DOI : 10.14708/ma.v6i13.1423
Classification : 05C20 (90B35 90C08)
Mots-clés : Directed graphs (digraphs), tournaments;Scheduling theory, deterministic;Special problems of linear programming(transportation, multi-index, etc.) 
@article{10_14708_ma_v6i13_1423,
     author = {J\'ozef Grabowski},
     title = {An algorithm for the solution of the traveling salesman problem via disjunctive graphs},
     journal = {Mathematica Applicanda},
     pages = { 81--98},
     publisher = {mathdoc},
     volume = {6},
     number = {13},
     year = {1978},
     doi = {10.14708/ma.v6i13.1423},
     language = {pl},
     url = {http://geodesic.mathdoc.fr/articles/10.14708/ma.v6i13.1423/}
}
TY  - JOUR
AU  - Józef Grabowski
TI  - An algorithm for the solution of the traveling salesman problem via disjunctive graphs
JO  - Mathematica Applicanda
PY  - 1978
SP  -  81
EP  - 98
VL  - 6
IS  - 13
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.14708/ma.v6i13.1423/
DO  - 10.14708/ma.v6i13.1423
LA  - pl
ID  - 10_14708_ma_v6i13_1423
ER  - 
%0 Journal Article
%A Józef Grabowski
%T An algorithm for the solution of the traveling salesman problem via disjunctive graphs
%J Mathematica Applicanda
%D 1978
%P  81-98
%V 6
%N 13
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.14708/ma.v6i13.1423/
%R 10.14708/ma.v6i13.1423
%G pl
%F 10_14708_ma_v6i13_1423
Józef Grabowski. An algorithm for the solution of the traveling salesman problem via disjunctive graphs. Mathematica Applicanda, Tome 6 (1978) no. 13, pp.  81-98. doi : 10.14708/ma.v6i13.1423. http://geodesic.mathdoc.fr/articles/10.14708/ma.v6i13.1423/

Cité par Sources :