• Dynamic Multiple Vehicle Routing under Energy Capacity Constraints 

      Polychronis G., Lalis S. (2020)
      The multiple vehicle routing problem (mVRP) concerns the scheduling of multiple vehicles so as to visit some locations of interest. We study a dynamic version of mVRP where the travel costs are not a priori known and may ...
    • Online graph exploration with advice 

      Dobrev, S.; Královič, R.; Markou, E. (2012)
      We study the problem of exploring an unknown undirected graph with non-negative edge weights. Starting at a distinguished initial vertex s, an agent must visit every vertex of the graph and return to s. Upon visiting a ...