eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2009-10-02
1
3
10.4230/DagSemProc.09261.15
article
Line Planning and Connectivity
Borndörfer, Ralf
Neumann, Marika
Pfetsch, Marc E.
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.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol09261/DagSemProc.09261.15/DagSemProc.09261.15.pdf
Steiner tree
generalization
paths