Gustavo Sadovoy

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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 to modify its route only at the vertices. This limitation directly affects the capacity of the server to react and increases the risk related to each decision. We prove lower(More)
  • 1