The traveling salesman problem with few inner points-Reference-Cited by-同舟云学术

The traveling salesman problem with few inner points

Published:2006-01 Issue:1 Volume:34 Page:106-110
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Deı˘neko Vladimir G.,Hoffmann Michael,Okamoto Yoshio,Woeginger Gerhard J.

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference20 articles.

1. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems;Arora;J. ACM,1998

2. The prize collecting traveling salesman problem;Balas;Networks,1989

3. Dynamic programming treatment of the traveling salesman problem;Bellman;J. ACM,1962

4. V.G. Deı˘neko, M. Hoffmann, Y. Okamoto, G.J. Woeginger, The traveling salesman problem with few inner points, Proceedings of 10th International Computing and Combinatorics Conference (COCOON 2004), Lecture Notes in Computer Science, vol. 3106, 2004, pp. 268–277.

5. The convex-hull-and-line traveling salesman problem;Deı˘neko;Inform. Process. Lett.,1996

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

1. Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time;Algorithmica;2024-07-18

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

3. A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization;ACM Transactions on Evolutionary Learning and Optimization;2021-12-31

4. A Degree 3 Plane $5.19$-Spanner for Points in Convex Position;Scientia Iranica;2021-07-21

5. Draft model of delivery routes at a city logistics scale when applying the Clarke-Wright method;The Archives of Automotive Engineering – Archiwum Motoryzacji;2020-03-30