Pages that link to "Item:Q2125364"
From MaRDI portal
The following pages link to An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (Q2125364):
Displaying 3 items.
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)
- A ride time-oriented scheduling algorithm for dial-a-ride problems (Q6561235) (← links)
- Efficient neighborhood evaluation for the maximally diverse grouping problem (Q6644387) (← links)
