Pages that link to "Item:Q6048503"
From MaRDI portal
The following pages link to Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed (Q6048503):
Displaying 5 items.
- A note on solving DiDi's driver-order matching problem (Q1996745) (← links)
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem (Q2815449) (← links)
- (Q4944966) (← links)
- Euler is standing in line dial-a-ride problems with precedence-constraints (Q5948963) (← links)
- Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems (Q6040633) (← links)