DagSemProc.09261.15.pdf
- Filesize: 136 kB
- 3 pages
Document
Line Planning and Connectivity
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 9261
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2009-10-02
Cite AsGet BibTex
Ralf Borndörfer, Marika Neumann, and Marc E. Pfetsch. Line Planning and Connectivity. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/DagSemProc.09261.15
https://doi.org/10.4230/DagSemProc.09261.15
Abstract
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.
Keywords
- Steiner tree
- generalization
- paths
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads