An efficient all-pairs approach for multi-objective dynamic shortest path problems

The Shortest Path problem is fundamental for determining optimal routes in various applications. The Dynamic Shortest Path problem extends this concept to evolving graph structures. However, existing algorithms often fail to address decision-making complexities involving multiple objectives. In our...

Ausführliche Beschreibung