Restricted 2-factor polytopes

Mathematical Programming, Series B

Volumn 87, Issue 1, 2000, Pages 87-111

  Cunningham, William H ^a   Wang, Yaoguang ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b PeopleSoft Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042722991     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101079900110     Document Type: Article

References (11)

1. Boyd, S.C., Cunningham, W.H. (1991): Small travelling salesman polytopes. Math. Oper. Res 16, 259-271
2. Carr, R.D. (1995): Separating clique tree and bipartition inequalities in polynomial time. In: Balas, E., Clausen, J., eds., Integer Programming and Combinatorial Optimization, pp. 40-49. Lect. Notes Comput. Sci. 920, Springer, Berlin
3. Cornuéjols, G., Pulleyblank, W.R. (1980): A matching problem with side conditions. Discrete Math. 29, 135-159
4. Edmonds, J. (1965): Maximum matching and a polyhedron with 0, 1-vertices. J. Res. Nat. Bur. Standards 69B, 147-153
5. Goemans, M.X., Williamson, D.P. (1995): A general approximation technique for constrained forest problems. SIAM J. Comput. 24, 296-317
6. Grötschel, M., Padberg, M.W. (1985): Polyhedral theory. In: Lawler, E., Lenstra, J.K., Rinnooy Kan, A., Shmoys, D., eds., The Traveling Salesman Problem. Wiley, New York
7. Grötschel, M., Padberg, M.W. (1979): On the symmetric travelling salesman problem II: lifting theorems and facets. Math. Program. 16, 281-302
8. Grötschel, M., Pulleyblank, W.R. (1986): Clique tree inequalities and the symmetric travelling salesman problem. Math. Oper. Res. 11, 537-569
9. Hartvigsen, D.B. (1984): Extensions of Matching Theory. Ph.D. Thesis, Carnegie Mellon University
10. Schrijver, A. (1986): Theory of Linear and Integer Programming. Wiley, Chichester
11. Vornberger, O. (1980): Easy and hard cycle covers. Preprint. Universität Paderborn