Author:
Goemans Michel X.,Bertsimas Dimitris J.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference39 articles.
1. A. Agrawal, P. Klein and R. Ravi, “When trees collide: An approximation algorithm for the generalized Steiner problem in networks,” in:Proceedings of the 23rd ACM Symposium on Theory of Computing (1991) pp. 134–144.
2. Y.P. Aneja, “An integer linear programming approach to the Steiner problem in graphs,”Networks 10 (1980) 167–178.
3. A. Balakrishnan, T.L. Magnanti and R.T. Wong, “A dual-ascent procedure for large-scale uncapacitated network design,”Operations Research 37 (1989) 716–740.
4. E. Balas and P. Toth, “Branch and Bound methods,” 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. 361–401.
5. D. Bienstock, M.X. Goemans, D. Simchi-Levi and D.P. Williamson, “A note on the prize collecting traveling salesman problem,”Mathematical Programming 59 (1993) 413–420.
Cited by
121 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Design of survivable networks with low connectivity requirements;International Transactions in Operational Research;2024-07-18
2. Ghost Value Augmentation for k-Edge-Connectivity;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. Survivable Networks;Encyclopedia of Optimization;2024
4. An Improved Approximation Guarantee for Prize-Collecting TSP;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Robust capacitated Steiner trees and networks with uniform demands;Networks;2023-03-03