1 paper · 1 filter
Zhibei Ma, Kai Yin, Lantao Liu +1
We consider an orienteering problem (OP) where an agent needs to visit a series (possibly a subset) of depots, from which the maximal accumulated profits are desired within given l…