1-10 von 15 Publikationen
DisKon - Disposition und Konfliktlösungsmanagement für die beste Bahn
(Techn. Univ., Fak. Verkehrswiss. Friedrich List, 2005)
Within the framework of a research cooperation we currently develop a laboratory version of a flexible, modular, and automatic dispatching system. The algorithms of this system shall support the recognition and solution ...
Locating a minisum circle in the plane
We consider the problem of locating a circle with respect to existing facilities in the plane such that the sum of weighted distances between the circle and the facilities is minimized, i.e., we approximate a set of given ...
The path player game
We introduce the path player game, a noncooperative network game with a continuum of mutually dependent set of strategies. This game models network flows from the point of view of competing network oper- ators. The ...
Anchored Hyperplane Location Problems
The anchored hyperplane location problem is to locate a hyperplane passing through some given points P ⊆ Rn and minimizing either the sum of weighted distances (median problem), or the maximum weighted distance (center ...
Line Planning with Minimal Traveling Time
(Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, 2006)
An important strategic element in the planning process of public transportation is the development of a line concept, i.e. to find a set of paths for operating lines on them. So far, most of the models in the literature ...
Linear Facility Location in Three Dimensions - Models and Solution Methods
The Computational Complexity of Delay Management
Delay management for public transport consists of deciding whether vehicles should wait for delayed transferring passengers, with the objective of minimizing the overall passenger discomfort. This paper classifies the ...
To Wait or Not to Wait? The Bicriteria Delay Management Problem in Public Transportation
Assume that a train reaches a station with delay. At the station there is a bus ready to depart. The question if such a bus should wait for the delayed train or if it should depart on time is called the delay ...
Locating a Circle on a Sphere
Shao's theorem on the maximum of standardized random walk increments for multidimensional arrays
(EDP Sciences, 2010)
We generalize a theorem of Shao [Proc. Amer. Math. Soc. 123 (1995) 575–582] on the almost-sure limiting behavior of the maximum of standardized random walk increments to multidimensional arrays of i.i.d. random variables. ...