Finding the exact integrality gap for small traveling Salesman problems

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

Volumn 2337 LNCS, Issue , 2002, Pages 83-92

  Boyd, Sylvia ^a   Labonté, Geneviève ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GRAPH THEORY; HAMILTONIANS; INTEGER PROGRAMMING;

COMPLETE GRAPHS; ELIMINATION PROBLEM; HAMILTONIAN CYCLE; INTEGRALITY GAPS; LINEAR RELAXATIONS; MINIMUM WEIGHT; SYMMETRIC TRAVELING SALESMAN PROBLEMS; UPPER BOUND;

TRAVELING SALESMAN PROBLEM;

EID: 84868662644     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47867-1_7     Document Type: Conference Paper

References (11)

1. Boyd, S., Carr. R. (1999): A new bound for the ratio between the 2-matching problem and its linear programming relaxation, Math. Prog. Series A 86, 499-514.
2. Boyd, S., Carr, R. (2000): Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices, Technical Report TR-96-12, University of Ottawa, Ottawa.
3. Boyd, S., Pulleyblank, W.R. (1991): Optimizing over the subtour polytope of the traveling salesman problem, Math. Prog. 49, 163-187.
4. Carr, R., Ravi, R. (1998): A new bound for the 2-edge connected subgraph problem, Proceedings of the Conference on Integer Programming and Combinatorial Optimization (IPCO'98).
5. Christof, T., Löbel, A, Stoer, M. (1997): PORTA, A POlyhedron Representation Transformation Algorithm, http://www.zib.de/Optimization/ Software/Porta/index.html
6. Christofides, N. (1976): Worst case analysis of a new heuristic for the traveling salesman problem, Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh.
7. Grötschel, M., Lovasz, L., Schrijver, A. (1988): Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin.
8. Johnson, D.S., Papadimitriou, C.H. (1985): Computational Complexity, In: Lawler et al, eds., The Traveling Salesman Problem, John Wiley & Sons, Chichester, 37-85.
9. McKay, B. (1991): nauty User's Guide (Version 1.5), Technical Report TR-CS-90-02, Department of Computer Science, Australia National University.
10. Shmoys, D.B., Williamson, D.P. (1990): Analyzing the Held-Karp TSP bound: A monotonicity property with application, Inf. Process. Lett. 35, 281-285.
11. Woolsey, L.A. (1980): Heuristic analysis, linear programming and branch and bound, Math. Prog. Study 13, 121-134.