Maximizing the number of rides served for time-limited Dial-a-Ride*
type: Item
instance of: scholarly article
title: Maximizing the number of rides served for time-limited Dial-a-Ride*
DOI: 10.1080/10556788.2024.2349091
author: Barbara M. Anthony
author: Christine Chung
author: Ananya Das
author: David S. Yuen
published in: Optimization Methods \& Software
publication date: 2025-01-10T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68R12
zbMATH DE Number: 7965420
MaRDI profile type: MaRDI publication profile
cites work: Maximizing the number of rides served for dial-a-ride
cites work: Serving rides of equal importance for time-limited dial-a-ride
cites work: Improved approximation algorithms for prize-collecting Steiner tree and TSP
cites work: Q2728857
cites work: Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
cites work: The prize collecting traveling salesman problem
cites work: Multiembedding of Metric Spaces
cites work: On-line scheduling to maximize task completions.
cites work: A note on the prize collecting traveling salesman problem
cites work: Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
cites work: Tight Bounds for Online TSP on the Line
cites work: Approximation Algorithms for Orienteering and Discounted-Reward TSP
cites work: Q2734595
cites work: Constrained TSP and low-power computing
cites work: From theory to practice: maximizing revenues for on-line dial-a-ride
cites work: Improved bounds for revenue maximization in time-limited online dial-a-ride
cites work: The dial-a-ride problem: Models and algorithms
cites work: Automata, Languages and Programming
cites work: A tight bound on approximating arbitrary metrics by tree metrics
cites work: On-line single-server dial-a-ride problems
cites work: Home health care routing and scheduling: a review
cites work: Nonpreemptive Ensemble Motion Planning on a Tree
cites work: A General Approximation Technique for Constrained Forest Problems
cites work: The online food delivery problem on stars
cites work: Online Vehicle Routing Problems: A Survey
cites work: Maximizing job completions online
cites work: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
cites work: Approximation and Online Algorithms
cites work: Q4411288
cites work: Typology and literature review for dial-a-ride problems
cites work: Prize-collecting TSP with a budget constraint
cites work: Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
cites work: A survey on offline scheduling with rejection
cites work: Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
description: scientific article; zbMATH DE number 7965420