Pages that link to "Item:Q3391966"
From MaRDI portal
The following pages link to A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem (Q3391966):
Displayed 11 items.
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem (Q375997) (← links)
- A school bus scheduling problem (Q439545) (← links)
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (Q743645) (← links)
- A comparison of five heuristics for the multiple depot vehicle scheduling problem (Q835636) (← links)
- A dual ascent procedure for the set partitioning problem (Q955334) (← links)
- Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows (Q1013387) (← links)
- On the choice of explicit stabilizing terms in column generation (Q1025985) (← links)
- Stabilized dynamic constraint aggregation for solving set partitioning problems (Q2253353) (← links)
- Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems (Q2433389) (← links)
- A proximal trust-region algorithm for column generation stabilization (Q2571184) (← links)
- Solving a real-world train-unit assignment problem (Q2638371) (← links)