C. Ribeiro

collaborators

2 papers

cs.DM2021

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…

math.OC2021

Maximum weighted induced forests and trees: New formulations and a computational comparative review

Rafael A. Melo, Celso C. Ribeiro

Given a graph $G = (V, E)$ with a weight $w_{v}$ associated with each vertex $v \in V$ , the maximum weighted induced forest problem (MWIF) consists of encountering a maximum weighted sub…