Separating maximally violated comb inequalities in planar graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1084, Issue , 1996, Pages 475-489

  Fleischer, Lisa ^a   Tardos, Éva ^a  

^a Cornell University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GRAPH THEORY; GRAPHIC METHODS; TRAVELING SALESMAN PROBLEM;

BENCH-MARK PROBLEMS; BRANCH-AND-CUT ALGORITHMS; CUTTING PLANE ALGORITHMS; FRACTIONAL SOLUTIONS; INTEGER PROGRAM; MINIMUM CUT; PLANAR GRAPH; POLYTOPES;

INTEGER PROGRAMMING;

EID: 84868660850     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_35     Document Type: Conference Paper

References (19)

1. Applegate, D., Bixby, R., Chvátal, V., Cook, W.: Finding Cuts in the TSP (A Preliminary Report). Unpublished manuscript. (1994)
2. 3) time. Proc. 26th Annual ACM Symp. on Theory of Comp. (1994) 658-667
3. Carr, R. D.: Separating Clique Tree and Bipartition Inequalities in Polynomial Time. Proc. 4th International IPCO Conference. Editors Balas, E., Clausen J., Springer-Verlag Lecture Notes in Computer Science 920 (1995) 40-49
4. Crowder, H., Padberg, M. W.: Solving large-scale symmetric travelling salesman problems to optimality. Management Sci. 26 (1980) 495-509
5. Dinits, E. A., Karzanov, A. V., Lomonosov, M. V.: On the structure of a family of minimal weighted cuts in a graph. Studies in Discrete Optimization, Editor Fridman, A. A., Moscow Nauka, in Russian (1976) 290-306
6. Fleischer, L., Tardos, E. Separating maximally violated comb inequalities in planar graphs. Cornell University, Department of Operations Research and Industrial Engineering, TR1150 (1996)
7. Gabow, H. N.: Applications of a poset representation to edge connectivity and graph rigidity. Proc. 32nd Annual Symp. on Found, of Comp. Sci. (1991) 812-821
8. Grötschel, M.: On the symmetric travelling salesman problem:solution of a 120-city problem. Math. Programming Study 12 (1980) 61-77
9. Grötschel, M., Holland, O.: Solution of large-scale symmetric travelling salesman problems. Math. Programming 51 (1991) 141-202
10. Grötschel, M., Padberg, M. W.: On the Symmetric Travelling Salesman Problem I: Inequalities. Math. Programming 16 (1979) 265-280
11. Grötschel, M., Padberg, M. W.: On the Symmetric Travelling Salesman Problem H: Lifting Theorems and Facets. Math. Programming 16 (1979) 281-302
12. Hao, J., Orlin, J. B.: A faster algorithm for finding the minimum cut in a graph. Proc. of 3rd ACM-SIAM Symp. on Discrete Algorithms (1992) 165-174
13. Held, M., Karp, R. M.: The traveling-salesman problem and minimum spanning trees. Operations Research 18 (1970) 1138-1162
14. Karger, D. R.: Minimum cuts in near-linear time. To appear in the Proceedings of the 28th ACM Symp. on Theory of Computing (1996)
15. Karzanov, A. V., Timofeev, E. A.: Efficient Algorithms for Finding all Minimal Edge Cuts of a Nonoriented Graph. Cybernetics 22 (1986) 156-162, Translated from Kibernetika 2 (1986) 8-12
16. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., Shmoys, D. B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley k. Sons (1985)
17. Naor, D., Vazirani, V. V.: Representing and enumerating edge connectivity cuts in RNC. Proc. Second Workshop on Algorithms and Data Structures, Springer-Verlag, Lecture Notes in Computer Science 519 (1991) 273-285
18. Nemhauser, G. L., Wolsey, L. A.: Integer and Combinatorial Optimization. John Wiley & Sons (1988)
19. Padberg, M. W., Rinaldi, G.; Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Oper. Res. Letters 6 (1987) 1-7