Algorithms for the on-line travelling salesman

In this paper the problem of efficiently serving a sequence of requests presented in an on-line fashion located at points of a metric space is considered. We call this problem the On-Line Travelling Salesman Problem (OLTSP). It has a variety of relevant applications in logistics and robotics. We con...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 2001
Materias:
Competitive analysis
On-line algorithms
Travelling salesman problem
Vehicle routing
Logistics
Problem solving
Robotics
Traveling salesman problem
Algorithms
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_01784617_v29_n4_p560_Ausiello
http://hdl.handle.net/20.500.12110/paper_01784617_v29_n4_p560_Ausiello
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares