Abstract
Given a graph G(V,E), the LongestInducedPath problem asks for a maximum cardinality node subset (formula presented) such that the graph induced by W 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
CITATION STYLE
Bökler, F., Chimani, M., Wagner, M. H., & Wiedera, T. (2020). An experimental study of ilp formulations for the longest induced path problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12176 LNCS, pp. 89–101). Springer. https://doi.org/10.1007/978-3-030-53262-8_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
