Rafael A. Melo

activity

20152021

most citedA fast and effective MIP-based heuristic for a selective and periodic inventory routing problem in reverse logistics

32 citations · 100 across the 10 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2021★ 6 cited

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…

cs.DM2015★ 11 cited

An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices

Rafael A. Melo, Phillippe Samer, Sebastián Urrutia

Given a graph $G = (V, E)$ , the minimum branch vertices problem consists in finding a spanning tree $T = (V, E^{'})$ of $G$ minimizing the number of vertices with degree greater than two. W…