13 search results - page 2 / 3 » The online Prize-Collecting Traveling Salesman Problem |
4OR
2004
13 years 5 months ago
2004
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...
COCOON
2004
Springer
13 years 11 months ago
2004
Springer
WADS
2005
Springer
13 years 11 months ago
2005
Springer
TCS
2008
13 years 5 months ago
2008
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
AAIM
2009
Springer
13 years 3 months ago
2009
Springer
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...