most citedScenic Routes Now: Efficiently Solving the Time-Dependent Arc Orienteering Problem

3 citations · 3 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2016★ 3 cited

Scenic Routes Now: Efficiently Solving the Time-Dependent Arc Orienteering Problem

Gregor Jossé, Ying Lu, Tobias Emrich +4

This paper extends the Arc Orienteering Problem (AOP) to large road networks with time-dependent travel times and time-dependent value gain, termed Twofold Time-Dependent AOP or 2T…