An experimental study of ILP formulations for the longest induced path problem

DOI10.1007/978-3-030-53262-8_8zbMath1458.90539arXiv2002.07012OpenAlexW3044254018MaRDI QIDQ2225052

Mirko H. Wagner, Fritz Bökler, Markus Chimani, Tilo Wiedera

Publication date: 4 February 2021

Full work available at URL: https://arxiv.org/abs/2002.07012

zbMATH Keywords

longest induced path, maximum cardinality node subset

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (3)

New formulations and branch-and-cut procedures for the longest induced path problem ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ Maximum weighted induced forests and trees: new formulations and a computational comparative review

This page was built for publication: An experimental study of ILP formulations for the longest induced path problem