Pages that link to "Item:Q1762670"
From MaRDI portal
The following pages link to A fast algorithm for near cost optimal line plans (Q1762670):
Displaying 14 items.
- Line planning in public transportation: models and methods (Q443830) (← links)
- Cost optimal allocation of rail passenger lines (Q1303534) (← links)
- The line planning routing game (Q1634301) (← links)
- An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem (Q1652047) (← links)
- Line planning with user-optimal route choice (Q1751827) (← links)
- How to optimize train stops under diverse passenger demand: a new line planning method for large-scale high-speed rail networks (Q2031204) (← links)
- The grid based approach, a fast local evaluation technique for line planning (Q2095522) (← links)
- Urban public transit network optimization with flexible demand (Q2260898) (← links)
- The Steiner connectivity problem (Q2434988) (← links)
- Column generation approach to line planning with various halting patterns - application to the Korean high-speed railway (Q2853407) (← links)
- Line planning on tree networks with applications to the Quito Trolebús system (Q4910665) (← links)
- Construction Line Algorithms for the Connection Location-Allocation Problem (Q5391943) (← links)
- Integrating train service route design with passenger flow allocation for an urban rail transit line (Q6087534) (← links)
- Train stop scheduling problem: an exact approach using valid inequalities and polar duality (Q6087540) (← links)
