Implementation of a linear time algorithm for certain generalized traveling salesman problems-Reference-Cited by-同舟云学术

Implementation of a linear time algorithm for certain generalized traveling salesman problems

Published:1996 Issue: Volume: Page:316-329
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Simonetti Neil,Balas Egon

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-61310-2_24.pdf

Reference11 articles.

1. E. Baker, “An Exact Algorithm for the Time-Constrained Traveling Salesman Problem.” Operations Research, 31, (1983) 938–945.

2. E. Balas, “New Classes of Efficiently Solvable Generalized Traveling Salesman Problems,” Management Science Research Report #MSRR-611, Graduate School of Industrial Administration, Carnegie Mellon University, March 1995.

3. M. Gendreau, A. Hertz, G. Laporte, M. Stan, “A Generalized Insertion Heuristics for the Traveling Salesman Problem with Time Windows.” Publication CRT-95-07, Centre de recherche sur les transports, Montréal, January 1995.

4. P. Kanellakis, C. Papadimiriou, “Local Search for the Traveling Salesman Problem.” Operations Research, 28, (1980) 1086–1099.

5. S. Lin, B. W. Kernighan, “An Effective Heuristic Algorithm for the Traveling Salesman Problem.” Operations Research, 21, (1973) 495–516.

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

1. Scheduling for multi-robot routing with blocking and enabling constraints;Journal of Scheduling;2021-04-30

2. Dynamic Programming for the Minimum Tour Duration Problem;Transportation Science;2017-05

3. Solution of real-world postman problems;European Journal of Operational Research;2008-10

4. Repeat inspection planning using dynamic programming;International Journal of Production Research;2006-01-15

5. A survey of very large-scale neighborhood search techniques;Discrete Applied Mathematics;2002-11