Serving rides of equal importance for time-limited dial-a-ride
DOI10.1007/978-3-030-77876-7_3zbMATH Open1485.90035OpenAlexW3169254060MaRDI QIDQ2117614FDOQ2117614
Authors: Barbara M. Anthony, Ananya D. Christman, Christine Chung, David S. Yuen 
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-77876-7_3
Recommendations
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cites Work
- The prize collecting traveling salesman problem
- A General Approximation Technique for Constrained Forest Problems
- A note on the prize collecting traveling salesman problem
- The dial-a-ride problem: Models and algorithms
- Improved approximation algorithms for prize-collecting Steiner tree and TSP
- Typology and literature review for dial-a-ride problems
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- Automata, Languages and Programming
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
- Serving rides of equal importance for time-limited dial-a-ride
- Constrained TSP and low-power computing
- Prize-collecting TSP with a budget constraint
Cited In (5)
- Serving rides of equal importance for time-limited dial-a-ride
- Maximizing the number of rides served for dial-a-ride
- Earliest deadline first is a 2-approximation for DARP with time windows
- Maximizing the number of rides served for time-limited Dial-a-Ride*
- Improved bounds for revenue maximization in time-limited online 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)
