Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP-Reference-Cited by-同舟云学术

Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP

Published:2006 Issue: Volume: Page:86-97
ISSN:0302-9743
Container-title:Combinatorial and Algorithmic Aspects of Networking
language:
Short-container-title:

Author:

Goldengorin Boris,Jäger Gerold,Molitor Paul

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11922377_8.pdf

Reference19 articles.

1. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2002)

2. Glover, F., Gutin, G., Yeo, A., Zverovich, A.: Construction heuristics for the asymmetric TSP. European J. Oper. Res. 129, 555–568 (2001)

3. Goldengorin, B., Jäger, G.: How To Make a Greedy Heuristic for the Asymmetric Traveling Salesman Competitive, SOM Research Report 05A11, University of Groningen, Groningen, The Netherlands (2005), http://som.eldoc.ub.rug.nl/reports/themeA/2005/05A11/05A11.pdf

4. Lecture Notes in Computer Science;B. Goldengorin,2006

5. Goldengorin, B., Jäger, G., Molitor, P.: Tolerances Applied in Combinatorial Optimization. J. Comput. Sci. 2(9), 716–734 (2006)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Formulations and branch-and-cut algorithms for production routing problems with time windows;Transportmetrica A: Transport Science;2018-01-26

2. The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems;Journal of Global Optimization;2016-12-10

3. The Theory of Set Tolerances;Lecture Notes in Computer Science;2014

4. The effect of the asymmetry of road transportation networks on the traveling salesman problem;Computers & Operations Research;2012-07

5. A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem;Computer Science – Theory and Applications;2010