Geodesic
Persistency in the Traveling Salesman Problem on Halin graphs
Discussiones Mathematicae. Graph Theory, Tome 20 (2000) no. 2, pp. 231-242

Voir la notice de l'article provenant de la source Library of Science

For the Traveling Salesman Problem (TSP) on Halin graphs with three types of cost functions: sum, bottleneck and balanced and with arbitrary real edge costs we compute in polynomial time the persistency partition E_All, E_Some, E_None of the edge set E, where:
Keywords: persistency, traveling salesman problem, Halin graph, polynomial algorithm 
Lacko, Vladimír. Persistency in the Traveling Salesman Problem on Halin graphs. Discussiones Mathematicae. Graph Theory, Tome 20 (2000) no. 2, pp. 231-242. http://geodesic.mathdoc.fr/item/DMGT_2000_20_2_a6/
@article{DMGT_2000_20_2_a6,
     author = {Lacko, Vladim{\'\i}r},
     title = {Persistency in the {Traveling} {Salesman} {Problem} on {Halin} graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {231--242},
     year = {2000},
     volume = {20},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2000_20_2_a6/}
}
TY  - JOUR
AU  - Lacko, Vladimír
TI  - Persistency in the Traveling Salesman Problem on Halin graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2000
SP  - 231
EP  - 242
VL  - 20
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DMGT_2000_20_2_a6/
LA  - en
ID  - DMGT_2000_20_2_a6
ER  - 
%0 Journal Article
%A Lacko, Vladimír
%T Persistency in the Traveling Salesman Problem on Halin graphs
%J Discussiones Mathematicae. Graph Theory
%D 2000
%P 231-242
%V 20
%N 2
%U http://geodesic.mathdoc.fr/item/DMGT_2000_20_2_a6/
%G en
%F DMGT_2000_20_2_a6

[1] K. Cechlárová, Persistency in the assignment and transportation problems, Math. Methods of Operations Research 47 (1998) 234-254.

[2] K. Cechlárová and V. Lacko, Persistency in some combinatorial optimization problems, in: Proc. Mathematical Methods in Economy 99 (Jindrichúv Hradec, 1999) 53-60.

[3] K. Cechlárová and V. Lacko, Persistency in combinatorial optimization problems on matroids, to appear in Discrete Applied Math.

[4] G. Cornuéjols, D. Naddef and W.R. Pulleyblank, Halin graphs and the Traveling salesman problem, Mathematical Programming 26 (1983) 287-294, doi: 10.1007/BF02591867.

[5] M.C. Costa, Persistency in maximum cardinality bipartite matchings, Operations Research Letters 15 (1994) 143-149, doi: 10.1016/0167-6377(94)90049-3.

[6] V. Lacko, Persistency in optimization problems on graphs and matroids, Master Thesis, UPJS Košice, 1998.

[7] V. Lacko, Persistency in the matroid product problem, in: Proc. CEEPUS Modern Applied Math. Workshop (AGH Kraków, 1999), 47-51.