Login / Signup

On Asymptotically Optimal Solvability of Euclidean Max m-k-Cycles Cover Problem.

Edward GimadiIvan A. Rykov
Published in: AIST (Supplement) (2020)
Keyphrases
  • asymptotically optimal
  • asymptotic optimality
  • heavy traffic
  • arrival rate
  • service rates
  • call center
  • multi dimensional
  • optimal policy
  • machine learning
  • reinforcement learning
  • scheduling problem