The station location problem on two intersecting lines
From MaRDI portal
Recommendations
Cited in
(9)- To stop or not to stop: a time-constrained trip covering location problem on a tree network
- Station location -- complexity and approximation
- scientific article; zbMATH DE number 2011862 (Why is no real title available?)
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Benders decomposition for set covering problems. Almost satisfying the consecutive ones property
- scientific article; zbMATH DE number 6179281 (Why is no real title available?)
- A bi-level objective based on trip-chain for inter-city rail stations
- Stop location design in public transportation networks: covering and accessibility objectives
- Covering a line segment with variable radius discs
This page was built for publication: The station location problem on two intersecting lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2847386)