Pages that link to "Item:Q3114703"
From MaRDI portal
The following pages link to A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems (Q3114703):
Displayed 11 items.
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (Q743645) (← links)
- Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows (Q1013387) (← links)
- Workforce planning in a lotsizing mail processing problem (Q1781576) (← links)
- An exact approach for the multi-depot electric bus scheduling problem with time windows (Q2106732) (← links)
- Railway crew scheduling: models, methods and applications (Q2286960) (← links)
- Reachability cuts for the vehicle routing problem with time windows (Q2432846) (← links)
- A new ILP-based refinement heuristic for vehicle routing problems (Q2583137) (← links)
- On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage (Q2673804) (← links)
- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
- Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models (Q5080634) (← links)
- Scheduling the vehicles of bus rapid transit systems: a case study (Q6092519) (← links)
