License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09261.15
URN: urn:nbn:de:0030-drops-21661
Go to the corresponding Portal

Borndörfer, Ralf ; Neumann, Marika ; Pfetsch, Marc E.

Line Planning and Connectivity

09261.NeumannMarika.ExtAbstract.2166.pdf (0.1 MB)


The line planning problem in public transport deals with the
construction of a system of lines that is both attractive for the
passengers and of low costs for the operator.
In general, the computed line system should be connected, i.e., for each two stations there have to be a path that is covered by the lines.
This subproblem is a generalization of the well-known Steiner tree problem;
we call it the Steiner connectivity Problem. We discuss complexity of this problem, generalize the so-called
Steiner partition inequalities and give a transformation to the
directed Steiner tree problem. We show that directed models provide
tight formulations for the Steiner connectivity problem, similar as
for the Steiner tree problem.

BibTeX - Entry

  author =	{Bornd\"{o}rfer, Ralf and Neumann, Marika and Pfetsch, Marc E.},
  title =	{{Line Planning and Connectivity}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9261},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M\"{o}hring},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-21661},
  doi =		{10.4230/DagSemProc.09261.15},
  annote =	{Keywords: Steiner tree, generalization, paths}

Keywords: Steiner tree, generalization, paths
Collection: 09261 - Models and Algorithms for Optimization in Logistics
Issue Date: 2009
Date of publication: 02.10.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI