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: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Wiley
2011
|
| Online Access: | http://hdl.handle.net/1721.1/62212 https://orcid.org/0000-0002-8585-6566 |