Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds

12 references·3 citing·29 second hop

FromToDepth

this work references cited by second hop

References

1998A Survey of Optimization Models for Train Routing and Scheduling788 cited
2002Modeling and Solving the Train Timetabling Problem614 cited
1988Scheduling project networks with resource constraints and time windows375 cited
1996Optimal scheduling of trains on a single line track373 cited
1998Railway Timetabling Using Lagrangian Relaxation316 cited
1980Models for rail transportation303 cited
1998Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm242 cited
2004Bicriteria train scheduling for high-speed passenger railroad planning applications194 cited
1991Tactical Scheduling of Rail Operations: The SCAN I System193 cited
1999Railway traffic control and train scheduling based oninter-train conflict management190 cited
1994A model and strategy for train pathing with choice of lines, platforms, and routes155 cited
1998A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations143 cited

Cited by

2014Single-line rail rapid transit timetabling under dynamic passenger demand288 cited
2014Simultaneous train rerouting and rescheduling on an N-track network: A model reformulation with network-based cumulative flow variables

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

286 cited

2015A Review of Online Dynamic Models and Algorithms for Railway Traffic Management262 cited