The embedding of the traveling salesman problem in a Markov Decision Process
Filar, Jerzy A
MetadataShow full item record
In this paper we derive a new LP-relaxation of the Traveling Salesman Problem (TSP, for short). This formulation comes from first embedding the TSP in a Markov Decision Process (MDP: for short), and from perturbing this MDP appropriately.