Serving rides of equal importance for time-limited dial-a-ride
From MaRDI portal
Publication:2117614
DOI10.1007/978-3-030-77876-7_3zbMath1485.90035OpenAlexW3169254060MaRDI QIDQ2117614
Barbara M. Anthony, Christine Chung, David S. Yuen, Ananya D. Christman
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-77876-7_3
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)
Related Items (1)
Cites Work
- A note on the prize collecting traveling salesman problem
- Typology and literature review for dial-a-ride problems
- Serving rides of equal importance for time-limited dial-a-ride
- The dial-a-ride problem: Models and algorithms
- Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
- The prize collecting traveling salesman problem
- A General Approximation Technique for Constrained Forest Problems
- Constrained TSP and low-power computing
- Prize-Collecting TSP with a Budget Constraint
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- Automata, Languages and Programming
This page was built for publication: Serving rides of equal importance for time-limited dial-a-ride
