Pages that link to "Item:Q6113356"
From MaRDI portal
The following pages link to Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356):
Displaying 5 items.
- Efficient feasibility testing for dial-a-ride problems (Q1866982) (← links)
- The absent-minded passengers problem: a motivating challenge solved by computer algebra (Q2071521) (← links)
- The dial-a-ride problem: Models and algorithms (Q2480256) (← links)
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem (Q3392004) (← links)
- Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems (Q6040633) (← links)