Martin Pečar: Bi-objective shortest path problem - speed-up approaches

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.