A note on the prize collecting traveling salesman problem-Reference-Cited by-同舟云学术

A note on the prize collecting traveling salesman problem

Published:1993-03 Issue:1-3 Volume:59 Page:413-420
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Bienstock Daniel,Goemans Michel X.,Simchi-Levi David,Williamson David

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01581256.pdf

Reference10 articles.

1. E. Balas, “The prize collecting traveling salesman problem,”Networks 19 (1989) 621–636.

2. N. Christofides, “Worst-case analysis of a new heuristic for the traveling salesman problem,” Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University (Pittsburgh, PA, 1976).

3. M.X. Goemans and D.J. Bertsimas, “On the parsimonious property of connectivity problems,” in:Proceeding of the 1st ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1990).

4. M. Held and R.M. Karp, “The traveling salesman problem and minimum spanning trees,”Operations Research 18 (1970) 1138–1162.

5. D.S. Johnson and C.H. Papadimitriou, “Performance guarantees for heuristics,” in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds.,The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985) pp. 145–180.

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

1. A unifying framework for selective routing problems;European Journal of Operational Research;2025-01

2. Prize-Collecting Steiner Tree: A 1.79 Approximation;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. A heuristic method for solving the Steiner tree problem in graphs using network centralities;PLOS ONE;2024-06-06

4. Maximizing the number of rides served for time-limited Dial-a-Ride*;Optimization Methods and Software;2024-05-23

5. Generalized class cover problem with axis-parallel strips;Computational Geometry;2024-04