Pages that link to "Item:Q613336"
From MaRDI portal
The following pages link to A note on ``Efficient feasibility testing for dial-a-ride problems'' (Q613336):
Displaying 10 items.
- A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
- Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh (Q631208) (← links)
- Typology and literature review for dial-a-ride problems (Q1698288) (← links)
- Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm (Q2029308) (← links)
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (Q2125364) (← links)
- Comparison of anticipatory algorithms for a dial-a-ride problem (Q2140208) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem (Q2669775) (← links)
- Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems (Q6040633) (← links)
- Graph representation of the fixed route dial-a-ride problem (Q6090221) (← links)