Online Dial-a-Ride Problems: Minimizing the Completion Time?

We consider the following online dial-a-ride problem (OlDarp): Objects are to be transported between points in a metric space. Transportation requests arrive online, specifying the objects to be transported and the corresponding source and destination. These requests are to be handled by a server wh...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Ascheuer, Norbert, Krumke, Sven O., Rambau, Jörg
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Competitive Algorithm Competitive Ratio Completion Time Computer science control theory systems Exact sciences and technology Flows in networks. Combinatorial problems Online Algorithm Operational research and scientific management Operational research. Management science Setup Cost Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!