Online traveling salesman problems with rejection options
In this article, we consider online versions of the traveling salesman problem on metric spaces for which requests to visit points are not mandatory. Associated with each request is a penalty (if rejected). Requests are revealed over time (at their release dates) to a server who must decide which re...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Wiley Blackwell
2015
|
| Online Access: | http://hdl.handle.net/1721.1/100431 https://orcid.org/0000-0002-8585-6566 |