7 citations · 7 across the 5 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.OC2016
Output-sensitive Complexity of Multiobjective Combinatorial Optimization
Fritz Bökler, Matthias Ehrgott, Christopher Morris +1
We study output-sensitive algorithms and complexity for multiobjective combinatorial optimization problems. In this computational complexity framework, an algorithm for a general e…
cs.DS2016
Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem
Fritz Bökler, Petra Mutzel
In this paper, we re-evaluate the basic strategies for label correcting algorithms for the multiobjective shortest path (MOSP) problem, i.e., node and label selection. In contrast…