The online target date assignment problem (2005)
Krumke, S.O., Megow, N., Rambau, J., Tuchscherer, A., Vredeveld, T.
Many online problems encountered in real-life involve a two-stage decision process: upon arrival of a new request, an irrevocable first-stage decision (the assignment of a specific resource to the...
How to cut a cake almost fairly (2002)
Krumke, S.O., Lipmann, M., Paepe, W. De, Poensgen, D., Rambau, J., Stougie, L., ...
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...
Multiscale Concepts for Moving Horizon Optimization (2001)
T. Binder, L. Blank, W. Dahmen, W. Marquardt, M. Grotschel, S. O. Krumke, ...
In chemical engineering complex dynamic optimization problems formulated on moving horizons have to be solved on-line. In this work, we present a multiscale approach based on wavelets where a...
Combinatorial Online Optimization in Real Time (2001)
Martin Otschel Krumke, J Rambau, Martin Gr Otschel, Sven O. Krumke, J Org Rambau, Thomas Winter, ...
. Optimization is the task of finding an optimum solution to a given problem. When the decision variables are discrete we speak of a combinatorial optimization problem. Such a problem is online when...
Online Optimization of Complex Transportation Systems (2001)
Martin Otschel Krumke, J Rambau, Martin Gr Otschel, Sven O. Krumke
. This paper discusses online optimization of real-world transportation systems. We concentrate on transportation problems arising in production and manufacturing processes, in particular in company...
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...
The Generalized Baues Problem for Cyclic Polytopes II (1970)
Christos Athanasiadis, J Rambau, Francisco Santos, Christos A. Athanasiadis, J Org Rambau
. Given an affine surjection of polytopes ß : P ! Q, the Generalized Baues Problem asks whether the poset of all proper polyhedral subdivisions of Q which are induced by the map ß has the homotopy...
The Online Target Date Assignment Problem
Heinz,S., Krumke,S.O., Megow,N., Rambau,J., Tuchscherer,A., Vredeveld,T.
Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a specific resource to the...