Efficient separation routines for the symmetric traveling salesman problem II: Separating multi handle inequalities

Mathematical Programming, Series B

Volumn 92, Issue 2, 2002, Pages 257-283

  Naddef, Denis ^a   Thienel, Stefan ^b  

^a GRENOBLE INSTITUTE OF TECHNOLOGY   (France)

^b UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMB INEQUALITIES; TRAVELING SALESMAN PROBLEMS;

ALGEBRA; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; PROBLEM SOLVING; TREES (MATHEMATICS);

OPERATIONS RESEARCH;

EID: 33751016059     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070100276     Document Type: Article

References (11)

1. Applegate, D., Bixby, R.E., Chvátal, V., Cook, W. (2000): Tsp cuts outside the template paradigm. Technical report, Computer sciences, Rutgers University, http://www.cs.rutgers.edu/~chvatal/dagstuhl.ps
2. Boyd, S.C., Cunningham, W.H. (1991): Small traveling salesman polytopes. Mathematics of Operations Research 16
3. Clochard, J.M., Naddef, D. (1993): Using path inequalities in a branch-and-cut code for the symmetric traveling salesman problem. In: Wolsey, L., Rinaldi, G., eds., Proceedings on the Third IPCO Conference, pp. 291-311
4. Cornuéjols, G., Fonlupt, J., Naddef, D. (1985): The traveling salesman problem on a graph and some related polyhedra. Mathematical Programming 33, 1-27
5. Fleischmann, B. (1988): A new class of cutting planes of the symmetric traveling salesman problem. Mathematical Programming 40, 225-246
6. Grötschel, M., Pulleyblank, W. (1986): Clique tree inequalities and the symmetric traveling salesman problem. Mathematics of Operations Research 11, 537-569
7. Naddef, D. (1992): The binested inequalities of the symmetric traveling salesman polytope. Mathematics of Operations Research 17, 882-900
8. Naddef, D., Pochet, Y. (1998): The traveling salesman polytope revisited. Technical report, CORE, Université de Louvain La neuve, to appear in Mathematics of Operations Research
9. Naddef, D., Thienel, S. (1999): Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation. Mathematical Programming, DOI 10.1007/s101070100275
10. Padberg, M.W., Rinaldi, G. (1990): Facet identification for the symmetric traveling salesman polytope. Mathematical Programming 47, 219-257
11. Reinelt, G. (1991): TSPLIB - a traveling salesman problem library. ORSA Journal on Computing 3, 376-384