New formulations and branch-and-cut procedures for the longest induced path problem
From MaRDI portal
Publication:6365613
DOI10.1016/J.COR.2021.105627zbMath1511.90408arXiv2104.09227MaRDI QIDQ6365613
Marcio C. Santos, Ruslán G. Marzo, Celso Carneiro Ribeiro, Rafael A. Melo
Publication date: 19 April 2021
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: New formulations and branch-and-cut procedures for the longest induced path problem