New formulations and branch-and-cut procedures for the longest induced path problem

Ruslán G. Marzo, Rafael A. Melo, Celso C. Ribeiro +1

Given an undirected graph $G=(V,E)$, the longest induced path problem (LIPP) consists of obtaining a maximum cardinality subset $W\subseteq V$ such that $W$ induces a simple path i…