The circuit polytope: Facets

Mathematics of Operations Research

Volumn 22, Issue 1, 1997, Pages 110-145

  Bauer, Petra ^a  

^a Department ZT AN 1   (Germany)

Author keywords

Circuit cone; Circuit polytope; Facets; Symmetric traveling salesman problem; Vehicle routing problem; Weighted girth problem

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; VECTORS;

BRANCH AND BOUND ALGORITHM; CIRCUIT POLYTOPE; SYMMETRIC TRAVELING SALESMAN PROBLEM; VEHICLE ROUTING PROBLEM; WEIGHTED GIRTH PROBLEM;

INTEGER PROGRAMMING;

EID: 0031072787     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.22.1.110     Document Type: Article

References (20)

1. Balas, E. (1993). On the cycle polytope of a directed graph, Management Science Research Report #MSRR-593, Graduate School of Industrial Administration, Carnegie Mellon University.
2. Bauer, P. (1994). A polyhedral approach to the weighted girth problem, Dissertation, Institut für Informatik, Universität zu Köln.
3. Boyd, S. C. (1991). Facet generating techniques, Research Report TR-91-31, Department of Computer Science, University of Ottawa.
4. Christof, Th. (1991). Ein Verfahren zur Transformation zwischen Polyederdarstellungen, Diplomarbeit, Universität Augsburg.
5. Chvátal, V. (1973). Edmonds polytopes and weakly hamiltonian graphs, Math. Programming 5 29-40.
6. Cornuéjols, G., J. Fonlupt, D. Naddef (1985). The traveling salesman problem on a graph and some related integer polyhedra, Math. Programming 33 1-27.
7. Coullard, C. R., W. R. Pulleyblank (1989). On cycle cones and polyhedra, Linear Algebra Appl. 114/115 613-640.
8. Edmonds, J. (1965). Maximum matching and a polyhedron with 0, 1-vertices, J. Res. Nat. Bur. Standards 69B 125-130.
9. Fischetti, M., J. J. Salazar, P. Toth (1993a). The symmetric generalized traveling salesman polytope, working paper, University of Bologna.
10. _, _, _ (1993b). A branch and cut algorithm for the symmetric generalized traveling salesman problem, working paper, University of Bologna.
11. Fleischmann, B. (1988). A new class of cutting planes for the symmetric traveling salesman problem, Math. Programming 40 225-246.
12. Grötschel, M., M. W. Padberg (1979a). On the symmetric traveling salesman problem I: Inequalities, Math. Programming 16 265-280.
13. _, _ (1979b). On the symmetric traveling salesman problem II: Lifting theorems and facets, Math. Programming 16 281-302.
14. _, W. R. Pulleyblank (1986). Clique tree inequalities and the symmetric traveling salesman problem, Math. Oper. Res. 11 537-569.
15. Naddef, D., G. Rinaldi (1988). The symmetric traveling salesman polytope: New facets from the graphical relaxation, Report R. 248, IASI-CNR Rome.
16. _, _ (1991). The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities, Math. Programming 51 359-400.
17. _, _ (1992). The crown inequalities for the symmetric traveling salesman polytope, Math. Oper. Res. 51 359-400.
18. _, _ (1993). The graphical relaxation: A new framework for the symmetric traveling salesman polytope, Math. Programming 58 53-88.
19. Seymour, P. D. (1979). Sums of Circuits. J. A. Bondy, U. R. S. Murty, eds. Graph Theory and Related Topics, Academic Press, New York, 341-355.
20. Wang, Y. (1995). Fleet Assignment, Eulerian Subtours and Extended Steiner Trees, Thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology.