A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem

@article{Fischetti1997ABA,
title={A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem},
author={Matteo Fischetti and Juan Jos{\'e} Salazar Gonz{\'a}lez and Paolo Toth},
journal={Operations Research},
year={1997},
volume={45},
pages={378-394}
}

Symmetri Generalized Travelling Salesman Problem Matteo Fis hetti Juan Jos e Salazar Gonz alezy Paolo Tothz January 1994; Revised May 1995 Abstra t We onsider a variant of the lassi al symmetri Travelling Salesman Problem in whi h the nodes are partitioned into lusters and the salesman has to visit at least one node for ea h luster. This NP-hard problem is known in the literature as the symmetri Generalized Travelling Salesman Problem (GTSP), and nds pra ti al appli ations in routing, s… CONTINUE READING