Pages that link to "Item:Q1046697"
From MaRDI portal
The following pages link to The train driver recovery problem-a set partitioning based model and solution method (Q1046697):
Displayed 11 items.
- Determining operations affected by delay in predictive train timetables (Q336779) (← links)
- Algorithms and implementation of a set partitioning approach for modular machining line design (Q339661) (← links)
- The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
- Application of an iterative framework for real-time railway rescheduling (Q1652076) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- A survey on robustness in railway planning (Q1754050) (← links)
- The home care crew scheduling problem: preference-based visit clustering and temporal dependencies (Q1926679) (← links)
- Real-time freight locomotive rescheduling and uncovered train detection during disruption (Q1926901) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space (Q2197157) (← links)
- Integer programming for minimal perturbation problems in university course timetabling (Q2398425) (← links)