SCOPUS 정보 검색 플랫폼

Operations Research Letters

Volumn 38, Issue 3, 2010, Pages 156-160

Simpler analysis of LP extreme points for traveling salesman and survivable network design problems

(3) Nagarajan, Viswanath a Ravi, R b Singh, Mohit c

a IBM T J WATSON RESEARCH CENTER (United States)

b CARNEGIE MELLON UNIVERSITY (United States)

c MCGILL UNIVERSITY (Canada)

Author keywords

Approximation algorithms; Linear programming relaxations; Survivable network design; Traveling salesman

Indexed keywords

EXTREME POINTS; LINEAR PROGRAMMING RELAXATION; LP RELAXATION; NETWORK DESIGN PROBLEMS; SURVIVABLE NETWORK DESIGN; SYMMETRIC TRAVELING SALESMAN PROBLEMS; TRAVELING SALESMAN;

APPROXIMATION ALGORITHMS; DESIGN; DYNAMIC PROGRAMMING; LINEARIZATION; MASS TRANSPORTATION; TORSIONAL STRESS;

TRAVELING SALESMAN PROBLEM;

EID: 77949916192 PISSN: 01676377 EISSN: None Source Type: Journal
DOI: 10.1016/j.orl.2010.02.005 Document Type: Article

Times cited : (15)

References (9)

1
- 84884063278
- Princeton University Press
- Applegate D.L., Bixby R.E., Chvátal V., and Cook W.J. The Traveling Salesman Problem: A Computational Study (2006), Princeton University Press
- (2006) The Traveling Salesman Problem: A Computational Study
- Applegate, D.L.¹ Bixby, R.E.² Chvátal, V.³ Cook, W.J.⁴

2
- 70350176693
- Additive guarantees for degree-bounded directed network design
- Bansal N., Khandekar R., and Nagarajan V. Additive guarantees for degree-bounded directed network design. SIAM J. Comput. 39 4 (2009) 1413-1431
- (2009) SIAM J. Comput. , vol.39 , Issue.4 , pp. 1413-1431
- Bansal, N.¹ Khandekar, R.² Nagarajan, V.³

3
- 34249952823
- Optimizing over the subtour polytope of the travelling salesman problem
- Boyd S.C., and Pulleyblank W.R. Optimizing over the subtour polytope of the travelling salesman problem. Math. Program. 49 2 (1990) 163-187
- (1990) Math. Program. , vol.49 , Issue.2 , pp. 163-187
- Boyd, S.C.¹ Pulleyblank, W.R.²

4
- 77952393165
- 3 log n)-approximation algorithm for vertex-connectivity survivable network design
- 3 log n)-approximation algorithm for vertex-connectivity survivable network design, in: Proceedings of FOCS, 2009.
- (2009) Proceedings of FOCS
- Chuzhoy, J.¹ Khanna, S.²

5
- 33747601366
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Fleischer L., Jain K., and Williamson D.P. Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems. J. Comput. System Sci. 72 5 (2006) 838-867
- (2006) J. Comput. System Sci. , vol.72 , Issue.5 , pp. 838-867
- Fleischer, L.¹ Jain, K.² Williamson, D.P.³

6
- 67651087393
- Approximating the smallest k-edge connected spanning subgraph by LP-rounding
- Gabow H.N., Goemans M.X., Tardos E., and Williamson D.P. Approximating the smallest k-edge connected spanning subgraph by LP-rounding. Networks 53 4 (2009) 345-357
- (2009) Networks , vol.53 , Issue.4 , pp. 345-357
- Gabow, H.N.¹ Goemans, M.X.² Tardos, E.³ Williamson, D.P.⁴

7
- 58149362471
- Worst-case comparison of valid inequalities for the TSP
- Goemans M. Worst-case comparison of valid inequalities for the TSP. Math. Program. 69 1-3 (2005) 335-349
- (2005) Math. Program. , vol.69 , Issue.1-3 , pp. 335-349
- Goemans, M.¹

8
- 77957077046
- Ball M.O., et al. (Ed)
- Grötschel M., Monma C.L., and Stoer M. Design of Survivable Networks. In: Ball M.O., et al. (Ed). Handbooks in OR & MS vol. 7 (1995) 617-671
- (1995) Handbooks in OR & MS , vol.7 , pp. 617-671
- Grötschel, M.¹ Monma, C.L.² Stoer, M.³

9
- 0005363324
- A factor 2-approximation algorithm for the generalized Steiner network problem
- Jain K. A factor 2-approximation algorithm for the generalized Steiner network problem. Combinatorica 21 1 (2001) 39-60
- (2001) Combinatorica , vol.21 , Issue.1 , pp. 39-60
- Jain, K.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.