2 papers
cs.DS2020
An Experimental Study of ILP Formulations for the Longest Induced Path Problem
Fritz Bökler, Markus Chimani, Mirko H. Wagner +1
Given a graph , the longest induced path problem asks for a maximum cardinality node subset such that the graph induced by is a path. It is a long estab…
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…