The n-line traveling salesman problem-Reference-Cited by-同舟云学术

The n-line traveling salesman problem

Published:1992-01 Issue:1 Volume:22 Page:91-108
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Rote Günter

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference13 articles.

1. On Recursions Connected With Symmetric Groups I

2. The traveling salesman problem on a graph and some related integer polyhedra

3. Efficient special case algorithms for the n-line planar traveling salesman problem

4. and , Solvable cases of the Euclidean traveling salesman problem. Research memorandum 424, University of Groningen, Department of Econometrics, Groningen, The Netherlands (1991).

5. , and , Well-solved special cases. The Traveling Salesman Problem (, , and , Eds.). Wiley, Chichester (1985) Chap. 4, 87–143.

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

1. Euclidean TSP in Narrow Strips;Discrete & Computational Geometry;2024-01-08

2. Multi-Robot Dynamic Swarm Disablement;2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS);2022-10-23

3. Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane;European Journal of Operational Research;2018-10

4. Crane scheduling in railway yards: an analysis of computational complexity;Journal of Scheduling;2017-04-27

5. Call-Based Dynamic Programming for the Precedence Constrained Line Traveling Salesman;Integration of AI and OR Techniques in Constraint Programming;2014