Euler is Standing in Line (2001)
D. Hauptmeier, S. O. Krumke, J. Rambau, H. -c. Wirth
In this paper we study algorithms for Dial-a-Ride" transportation problems. In the basic version of the problem we are given transportation jobs between the vertices of a graph and the goal is to nd...
Euler is Standing in Line - Dial-a-Ride Problems with Precedence-Constraints (2000)
D. Hauptmeier, S. O. Krumke, J. Rambau, H. -c. Wirth
In this paper we study algorithms for Dial-a-Ride" transportation problems. In the basic version of the problem we are given transportation jobs between the vertices of a graph and the goal is to nd...
Euler is Standing in Line - Dial-a-Ride Problems with FIFO-Precedence-Constraints (1970)
Dietrich Hauptmeier, Krumke Rambau, Hans-christoph Wirth, D. Hauptmeier, S. O. Krumke, J. Rambau
. In this paper we study algorithms for "Dial-a-Ride" transportation problems. In the basic version of the problem we are given transportation jobs between the vertices of a graph and the goal is to...