We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK


97% of Lancaster students go into work or further study within six months of graduating

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

« Back

Compact formulations of the Steiner traveling salesman problem and related problems

Research output: Contribution to journalJournal article


<mark>Journal publication date</mark>2013
<mark>Journal</mark>European Journal of Operational Research
Number of pages10
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.

Related projects