Maximizing the number of rides served for time-limited Dial-a-Ride*
From MaRDI portal
Publication:6661115
DOI10.1080/10556788.2024.2349091MaRDI QIDQ6661115
Barbara M. Anthony, David S. Yuen, Ananya Das, Christine Chung
Publication date: 10 January 2025
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Analysis of algorithms (68W40) Approximation algorithms (68W25) Metric embeddings as related to computational problems and algorithms (68R12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey on offline scheduling with rejection
- A note on the prize collecting traveling salesman problem
- Home health care routing and scheduling: a review
- Typology and literature review for dial-a-ride problems
- From theory to practice: maximizing revenues for on-line dial-a-ride
- Improved bounds for revenue maximization in time-limited online dial-a-ride
- The online food delivery problem on stars
- Serving rides of equal importance for time-limited dial-a-ride
- The dial-a-ride problem: Models and algorithms
- On-line scheduling to maximize task completions.
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
- Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
- Nonpreemptive Ensemble Motion Planning on a Tree
- Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line
- Online Vehicle Routing Problems: A Survey
- The prize collecting traveling salesman problem
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- Multiembedding of Metric Spaces
- Maximizing job completions online
- A General Approximation Technique for Constrained Forest Problems
- Tight Bounds for Online TSP on the Line
- 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
- Automata, Languages and Programming
- Approximation and Online Algorithms
- Approximation and Online Algorithms
- A tight bound on approximating arbitrary metrics by tree metrics
- On-line single-server dial-a-ride problems
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
- Maximizing the number of rides served for dial-a-ride
This page was built for publication: Maximizing the number of rides served 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 Q6661115)