FOR THE CURRENT CHOICE. ONLINE PROBLEMS, SUCH AS VEHICLE ROUTING AND CONTROL, (2008)
Norbert Ascheuer, Sven O. Krumke, Norbert Ascheuer, Sven O. Krumke
SIDERED GIVEN. THE STANDARD THEORY AND THE USUAL ALGORITHMIC TECHNIQUES AP
Konrad-Zuse-Zentrum fur Informationstechnik Berlin (2007)
Norbert Ascheuer, Norbert Ascheuer, Matteo Fischetti, Matteo Fischetti, Martin Grotschel, Martin Grotschel
A polyhedral study of the asymmetric travelling salesman problem with time windows Preprint SC 97--11 (February 1997) A polyhedral study of the asymmetric travelling salesman problem with time windows
Michael J Unger, Norbert Ascheuer, Norbert Ascheuer, Michael Junger, Gerhard Reinelt
In this article we consider a variant of the classical asymmetric traveling salesman problem (ATSP), namely the ATSP in which precedence constraints require that certain nodes must precede certain...
Online Dial-a-Ride Problems: Minimizing the Completion Time (2000)
Norbert Ascheuer, Sven O. Krumke, Jörg Rambau
. 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...
A polyhedral study of the asymmetric travelling salesman problem with time Windows (2000)
Norbert Ascheuer, Matteo Fischetti, Martin Grötschel
The asymmetric traveling salesman problem with time windows (ATSP-TW) is a basic model for scheduling and routing applications. In this paper, we present a formulation of the problem involving only...
A Branch, Cut Algorithm, Norbert Ascheuer, Michael Jünger, Gerhard Reinelt, Michael J Unger
In this article we consider a variant of the classical asymmetric traveling salesman problem (ATSP), namely the ATSP in which precedence constraints require that certain nodes must precede certain...
The online transportation problem: competitive scheduling of elevators (1998)
Norbert Ascheuer, Sven O. Krumke, Jörg Rambau
In this paper we consider the following online transportation problem (OLTP): Objects are to be transported between the vertices of a given graph. Transportation requests arrive online, specifying...
The online transportation problem: competitive scheduling of elevators (1998)
Norbert Ascheuer, Sven O. Krumke, Norbert Ascheuer, Sven O. Krumke, Jorg Rambau
ABSTRACT. In this paper we consider the following online transportation problem (OLTP): Objects are to be transported between the vertices of a given graph. Transportation requests arrive online,...
Branch Cut Algorithm for the Asymetric Traveling Salesman Problem with Precedence Constraints (1997)
Norbert Ascheuer, Gerhard Reinelt, Norbert Ascheuer, Michael Jünger, Gerhard Reinelt
In this article we consider a variant of the classical asymmetric traveling salesman problem (ATSP), namely the ATSP in which precedence constraints require that certain nodes must precede certain...
Mikrofiche-Ausg.: 3 Mikrofiches : 24x.
Thesis (doctoral)--Technische Universität Berlin, 1994.