In this paper we consider the location of stops along the edges of an already existing public transportation network. This can be the introduction of bus stops along some given bus routes, or of railway stations along the tracks in a railway network.The positive effect of new stops is given by...

Robust optimization considers optimization problems with uncertainty in the data. The common data model assumes that the uncertainty can be represented by an uncertainty set. Classic robust optimization considers the solution under the worst case scenario. The resulting solutions are often too...

A global optimization procedure is proposed to find a line in the Euclidean three-dimensional space which minimizes the sum of distances to a given finite set of three-dimensional data points. Although we are using similar techniques as for location problems in two dimensions, it is shown that...

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 operators. The players are represented by paths in the network. They have to decide how much flow...

In this paper the following facility location problem in a mixed planar-network space is considered: We assume that traveling along a given network is faster than traveling within the plane according to the Euclidean distance. A pair of points (A <Subscript> i </Subscript>,A <Subscript> j </Subscript>) is called covered if the time to...</subscript></subscript>