Home > Research > Publications & Outputs > Compact formulations of the Steiner traveling s...
View graph of relations

Compact formulations of the Steiner traveling salesman problem and related problems

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>2013
<mark>Journal</mark>European Journal of Operational Research
Issue number1
Number of pages10
Pages (from-to)83-92
Publication StatusPublished
Early online date8/03/13
<mark>Original language</mark>English


The Steiner Traveling Salesman Problem (STSP) is a variant of the TSP that is particularly suitable when routing on real-life road networks. The standard integer programming formulations of both the TSP and STSP have an exponential number of constraints. On the other hand, several compact formulations of the TSP, i.e., formulations of polynomial size, are known. In this paper, we adapt some of them to
the STSP, and compare them both theoretically and computationally. It turns out that, just by putting the best of the formulations into the CPLEX branch-and-bound solver, one can solve instances with over 200 nodes. We also briefly discuss the adaptation of our formulations to some related problems.

Bibliographic note

Accepted January 2013.