Results 81 to 90 of about 5,516 (203)

Revenue Maximization in Online Dial-A-Ride.

, 2017
We study a variation of the Online-Dial-a-Ride Problem where each request comes with not only a source, destination and release time, but also has an associated revenue. The server's goal is to maximize its total revenue within a given time limit, T. We show that the competitive ratio is unbounded for any deterministic online algorithm for the problem.
Christman, Ananya, Chung, Christine, Jaczko, Nicholas, Milan, Marina, Vasilchenko, Anna, Westvold, Scott   +5 more
openaire   +3 more sources

Introduction à la notion d'anticipation et de robustesse dans les problèmes de dial-a-ride dynamiques [PDF]

, 2013
Soumis à JESALe dial-a-ride problem, noté DARP, est un problème d'optimisation combinatoire associé aux transports à la demande. Il consiste à construire des tournées de véhicules satisfaisant plusieurs requêtes de transport de personnes, ces requêtes ...
Deleplanque, Samuel, Quilliot, Alain
core   +2 more sources

On-line single-server dial-a-ride problems

Theoretical Computer Science, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feuerstein, E., Stougie, L.
openaire   +4 more sources

A Decomposition Algorithm to Solve the Multi-Hop Peer-to-Peer Ride-Matching Problem

, 2017
In this paper, we mathematically model the multi-hop Peer-to-Peer (P2P) ride-matching problem as a binary program. We formulate this problem as a many-to-many problem in which a rider can travel by transferring between multiple drivers, and a driver can ...
Jayakrishnan, R., Masoud, Neda
core   +1 more source

The Laugh of the Tramp

Critical Quarterly, Volume 67, Issue 4, Page 17-31, December 2025.
Damian Maher
wiley   +1 more source

Approximating k-Forest with Resource Augmentation: A Primal-Dual Approach

, 2016
In this paper, we study the $k$-forest problem in the model of resource augmentation. In the $k$-forest problem, given an edge-weighted graph $G(V,E)$, a parameter $k$, and a set of $m$ demand pairs $\subseteq V \times V$, the objective is to construct a
A Blum, A Blum, A Borodin, A Gupta, A Srivastav, A Wigderson, B Birnbaum, B Kalyanasundaram, B Kalyanasundaram, C Chung, C Lund, CA Phillips, D Segev, DP Williamson, DS Johnson, E Koutsoupias, J Könemann, K Jain, K Jain, M Haimovich, MX Goemans, NE Young, O Ohrimenko, PN Klein, S Khot, U Feige, U Feige, VV Vazirani, Y Asahiro   +28 more
core   +3 more sources

A structural view of corporate purposes

European Management Review, Volume 22, Issue 4, Page 859-879, December 2025.
Margaret Blair, Anna Grandori, Stephan Leixnering, Joseph T. Mahoney   +3 more
wiley   +1 more source

Enhancing Service Quality of On-Demand Transportation Systems Using a Hybrid Approach with Customized Heuristics

Smart Cities
As customers’ expectations continue to rise, advanced on-demand transport services face the challenge of meeting new requirements. This study addresses a specific transportation issue belonging to dial-a-ride problems, including constraints aimed at ...
Sonia Nasri, Hend Bouziri, Wassila Aggoune Mtalaa   +2 more
doaj   +1 more source

Handbook on Employment of Persons with a Disability - Support Services [PDF]

, 2004
[Excerpt] Nowadays, more and more employers are willing to employ persons with a disability after learning about their working capacity. However, some employers who wish to offer them employment opportunities might have concern over their accommodation ...
Hong Kong Labour Department, Selective Placement Division
core   +1 more source

The Line-Based Dial-a-Ride Problem

20 pages, 5 figures, to be published in OASIcs, Volume 123, ATMOS ...
Kendra Reiter, Marie Schmidt, Michael Stiglmayr   +2 more
openaire   +4 more sources