| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6898051 | European Journal of Operational Research | 2013 | 10 Pages |
Abstract
⺠Most papers on the TSP assume that the graph is complete. ⺠The Steiner TSP is a variant of the TSP defined on general graphs. ⺠The existing integer programming formulation has an exponential number of constraints. ⺠We present several formulations that are of polynomial size. ⺠We also present similar compact formulations for some related problems.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis,