Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems

Details Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems

2012-03-17

arxiv.org/abs/1203.3854v1

Mathematics

Optimization and Control

submitted to EJOR

Scientific paper

The Steiner Traveling Salesman Problem (STSP) is a variant of the Traveling Salesman Problem (TSP) that is particularly suitable when dealing with sparse networks, such as road networks. The standard integer programming formulation of the STSP has an exponential number of constraints, just like the standard formulation of the TSP. On the other hand, there exist several known {\em compact} formulations of the TSP, i.e., formulations with a polynomial number of both variables and constraints. In this paper, we show that some of these compact formulations can be adapted to the STSP. We also briefly discuss the adaptation of our formulations to some closely-related problems.

Affiliated with

Also associated with

No associations

Rating

Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-313039