Discrete online TSP

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

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Aprea, M., Feuerstein, E., Sadovoy, G., De Loma, A.S.
Formato: SER
Materias:
Discrete metric spaces
Online algorithms
TSP
Competitive analysis
Competitive ratio
Deterministic online algorithms
Empirical simulations
Lower bounds
Metric spaces
Weighted graph
Control theory
Risk perception
Set theory
Topology
Traveling salesman problem
Algorithms
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03029743_v5564LNCS_n_p29_Aprea
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares