An Experimental Study of ILP Formulations for the Longest Induced Path Problem
Data Structures and Algorithms
2020-10-20 v3
Abstract
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 established problem with applications, e.g., in network analysis. We propose novel integer linear programming (ILP) formulations for the problem and discuss efficient implementations thereof. Comparing them with known formulations from literature, we prove that they are beneficial in theory, yielding stronger relaxations. Moreover, our experiments show their practical superiority.
Cite
@article{arxiv.2002.07012,
title = {An Experimental Study of ILP Formulations for the Longest Induced Path Problem},
author = {Fritz Bökler and Markus Chimani and Mirko H. Wagner and Tilo Wiedera},
journal= {arXiv preprint arXiv:2002.07012},
year = {2020}
}