Pages that link to "Item:Q816407"
From MaRDI portal
The following pages link to Maximizing trip coverage in the location of a single rapid transit alignment (Q816407):
Displaying 22 items.
- Rapid transit network design for optimal cost and origin-destination demand capture (Q336685) (← links)
- Path based algorithms for metro network design (Q337631) (← links)
- Line planning in public transportation: models and methods (Q443830) (← links)
- A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments (Q458952) (← links)
- A Lagrangian relaxation approach for expansion of a highway network (Q512983) (← links)
- Locating stops along bus or railway lines -- a bicriteria problem (Q816419) (← links)
- Urban rapid transit network design: accelerated Benders decomposition (Q839775) (← links)
- An approach for solving a modification of the extended rapid transit network design problem (Q845571) (← links)
- An extension to rapid transit network design problem (Q926579) (← links)
- Urban rapid transit network capacity expansion (Q930937) (← links)
- Location of infrastructure in urban railway networks (Q960393) (← links)
- An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem (Q1652047) (← links)
- Multi-objective rapid transit network design with modal competition: the case of Concepción, Chile (Q1652050) (← links)
- Integrated approach to network design and frequency setting problem in railway rapid transit systems (Q1652202) (← links)
- Corridor-based metro network design with travel flow capture (Q1652444) (← links)
- Improved rapid transit network design model: considering transfer effects (Q1686509) (← links)
- Line planning with user-optimal route choice (Q1751827) (← links)
- A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances (Q1753405) (← links)
- Solving real-size stochastic railway rapid transit network construction scheduling problems (Q2669704) (← links)
- To stop or not to stop: a time-constrained trip covering location problem on a tree network (Q2675712) (← links)
- On designing connected rapid transit networks reducing the number of transfers (Q5388152) (← links)
- Location Science in Canada (Q6102878) (← links)