Compact formulations of the Steiner traveling salesman problem and related problems

Letchford, Adam and Nasiri, Saeideh D. (2013) Compact formulations of the Steiner traveling salesman problem and related problems. European Journal of Operational Research, 228 (1). pp. 83-92. ISSN 0377-2217

Full text not available from this repository.

Abstract

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.

Item Type:
Journal Article
Journal or Publication Title:
European Journal of Operational Research
Additional Information:
Accepted January 2013.
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
ID Code:
62788
Deposited By:
Deposited On:
11 Mar 2013 15:16
Refereed?:
Yes
Published?:
Published
Last Modified:
07 Oct 2020 02:18