Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Mosis, Nils"'
Autor:
Disser, Yann, Mosis, Nils
We construct a family of Markov decision processes for which the policy iteration algorithm needs an exponential number of improving switches with Dantzig's rule, with Bland's rule, and with the Largest Increase pivot rule. This immediately translate
Externí odkaz:
http://arxiv.org/abs/2309.14034
Publikováno v:
LNCS volume 13538 (2022) 154-171
We consider the open online dial-a-ride problem, where transportation requests appear online in a metric space and need to be served by a single server. The objective is to minimize the completion time until all requests have been served. We present
Externí odkaz:
http://arxiv.org/abs/2210.13854