Pages that link to "Item:Q2359149"
From MaRDI portal
The following pages link to GRASP algorithms for the robust railway network design problem (Q2359149):
Displaying 7 items.
- Practical constraint \(K\)-segment principal curve algorithms for generating railway GPS digital map (Q460363) (← links)
- An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem (Q1652047) (← links)
- Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm (Q2192028) (← links)
- Revisiting a game theoretic framework for the robust railway network design against intentional attacks (Q2253567) (← links)
- Benders decomposition for network design covering problems (Q2669611) (← links)
- Integrating Robust Railway Network Design and Line Planning under Failures (Q3649169) (← links)
- The complexity of the timetable‐based railway network design problem (Q6196872) (← links)