Online Traveling Salesman Problems with Service Flexibility
The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem. We are concerned here with online versions of this problem defi ned on metric spaces. One novel aspect in the paper is the introduction of a sound theoretical model to incorporate "yes-no" decisions...
Main Authors: | Jaillet, Patrick, Lu, Xin |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Wiley
2011
|
Online Access: | http://hdl.handle.net/1721.1/62212 https://orcid.org/0000-0002-8585-6566 |
Similar Items
-
Online traveling salesman problems with rejection options
by: Jaillet, Patrick, et al.
Published: (2015) -
Probabilistic Traveling Salesman Problems
by: Jaillet, Patrick
Published: (2005) -
An improved lower bound for the Traveling Salesman constant
by: Gaudio, Julia, et al.
Published: (2021) -
The retrace traveling salesman problem : a new extension of traveling salesman problem /
by: 212543 Juraidawati Arbain
Published: (2003) -
The retrace traveling salesman problem : a new extension of traveling salesman problem
by: Arbain, Juraidawati
Published: (2003)