The Symmetric Traveling Salesman Polytope : New Facets from the Graphical Relaxation - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Mathematics of Operations Research Année : 2007

The Symmetric Traveling Salesman Polytope : New Facets from the Graphical Relaxation

Denis Naddef
  • Fonction : Auteur
  • PersonId : 844484
G. Rinaldi
  • Fonction : Auteur
  • PersonId : 828529

Résumé

The path, the wheelbarrow, and the bicycle inequalities have been shown by Cornuéjols, Fonlupt, and Naddef to be facetdefining for the graphical relaxation of STSP(n), the polytope of the symmetric traveling salesman problem on an n-node complete graph. We show that these inequalities, and some generalizations of them, define facets also for STSP(n). In conclusion, we characterize a large family of facet-defining inequalities for STSP(n) that include, as special cases, most of the inequalities currently known to have this property as the comb, the clique tree, and the chain inequalities. Most of the results given here come from a strong relationship of STSP(n) with its graphical relaxation that we have pointed out in another paper, where the basic proof techniques are also described.
Fichier non déposé

Dates et versions

hal-00189217 , version 1 (20-11-2007)

Identifiants

  • HAL Id : hal-00189217 , version 1

Citer

Denis Naddef, G. Rinaldi. The Symmetric Traveling Salesman Polytope : New Facets from the Graphical Relaxation. Mathematics of Operations Research, 2007, 32 (1), pp.233-256. ⟨hal-00189217⟩
88 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More