Online Traveling Salesman Problems with Service Flexibility

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 on...

Full description

Bibliographic Details
Main Authors: Jaillet, Patrick (Contributor), Lu, Xin (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor), Massachusetts Institute of Technology. Operations Research Center (Contributor), Sloan School of Management (Contributor)
Format: Article
Language:English
Published: Wiley, 2011-04-14T20:35:31Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items