Serving rides of equal importance for time-limited dial-a-ride
From MaRDI portal
Publication:2117614
Recommendations
Cites work
- A General Approximation Technique for Constrained Forest Problems
- A note on the prize collecting traveling salesman problem
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- Automata, Languages and Programming
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
- Constrained TSP and low-power computing
- Improved approximation algorithms for prize-collecting Steiner tree and TSP
- Prize-collecting TSP with a budget constraint
- Serving rides of equal importance for time-limited dial-a-ride
- The dial-a-ride problem: Models and algorithms
- The prize collecting traveling salesman problem
- Typology and literature review for dial-a-ride problems
Cited in
(5)- Maximizing the number of rides served for dial-a-ride
- Serving rides of equal importance for time-limited dial-a-ride
- Earliest deadline first is a 2-approximation for DARP with time windows
- Improved bounds for revenue maximization in time-limited online dial-a-ride
- Maximizing the number of rides served for time-limited Dial-a-Ride*
This page was built for publication: Serving rides of equal importance for time-limited dial-a-ride
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117614)