Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Jaczko, Nicholas"'
Autor:
Christman, Ananya, Chung, Christine, Jaczko, Nicholas, Li, Tianzhi, Westvold, Scott, Xu, Xinyue
In the Online-Dial-a-Ride Problem (OLDARP) a server travels through a metric space to serve requests for rides. We consider a variant where each request specifies a source, destination, release time, and revenue that is earned for serving the request
Externí odkaz:
http://arxiv.org/abs/1912.06300
Autor:
Christman, Ananya, Chung, Christine, Jaczko, Nicholas, Li, Tianzhi, Westvold, Scott, Xu, Xinyue, Yuen, David
Publikováno v:
Combinatorial Algorithms
In the Online-Dial-a-Ride Problem (OLDARP) a server travels to serve requests for rides. We consider a variant where each request specifies a source, destination, release time, and revenue that is earned for serving the request. The goal is to maximi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmc_________::0753522d32ed580dbe0af873ee3ac6b2
http://europepmc.org/articles/PMC7254915
http://europepmc.org/articles/PMC7254915
Publikováno v:
Journal of Combinatorial Optimization; Oct2022, Vol. 44 Issue 3, p1556-1577, 22p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Christman, Ananya, Chung, Christine, Jaczko, Nicholas, Milan, Marina, Vasilchenko, Anna, Westvold, Scott
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.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a4b54a0843cb1845a4205e4eede57d4