Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP
暂无分享,去创建一个
[1] Louis Salvail,et al. How to Convert the Flavor of a Quantum Bit Commitment , 2001, EUROCRYPT.
[2] Abraham P. Punnen,et al. The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms , 1997 .
[3] Rasmus Pagh,et al. Optimal time-space trade-offs for non-comparison-based sorting , 2002, SODA '02.
[4] Frits W. Vaandrager,et al. Linear parametric model checking of timed automata , 2001, J. Log. Algebraic Methods Program..
[5] Kim G. Larsen,et al. Minimum-Cost Reachability for Priced Timed Automata , 2001, HSCC.
[6] Gregory Gutin,et al. TSP tour domination and Hamilton cycle decompositions of regular digraphs , 2001, Oper. Res. Lett..
[7] Anna Pagh,et al. The Complexity of Constructing Evolutionary Trees Using Experiments , 2001, ICALP.
[8] Gerhard Reinelt,et al. Traveling salesman problem , 2012 .
[9] Weixiong Zhang,et al. The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests , 2001, ALENEX.
[10] G. Reinelt. The traveling salesman: computational solutions for TSP applications , 1994 .
[11] Gregory Gutin,et al. Traveling Salesman Should not be Greedy: Domination Analysis of Greedy-Type Heuristics for the TSP , 2001 .
[12] Gerd Behrmann,et al. Efficient Guiding Towards Cost-Optimality in UPPAAL , 2001, TACAS.
[13] Peter D. Mosses. CASL for CafeOBJ Users , 2000 .
[14] Gregory Gutin,et al. Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number , 2002, Discret. Appl. Math..
[15] Fred W. Glover,et al. Construction heuristics for the asymmetric TSP , 2001, Eur. J. Oper. Res..
[16] Paul Pettersson,et al. Tools and Algorithms for the Construction and Analysis of Systems: 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022, Proceedings, Part II , 1998, TACAS.