Bi-objective shortest path problem - speed-up approaches (Seminar DM)

Iz MaFiRaWiki

Bi-objective shortest path problem - speed-up approaches

Martin Pečar

Torek, 1. marca 2016, od 10h do 12h, Plemljev seminar, Jadranska 19


Povzetek:

Povzetek: A recent algorithm for bi-objective shortest path - Pulse - is a combination of depth-first-search and branch-and-bound techniques. It works on general graphs. Some types of graphs (like road networks) allow additional speed-ups using contraction hierarchies. We will present some of our results regarding this topic.

Seminar za diskretno matematiko

Osebna orodja