18 citations · 40 across the 4 of their papers we have counts for
Showing 2021Show 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 , the longest induced path problem (LIPP) consists of obtaining a maximum cardinality subset such that induces a simple path i…
math.OC2021★ 9 cited
A matheuristic approach for the -coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic
Rafael A. Melo, Michell F. Queiroz, Marcio C. Santos
Given a graph , the -coloring problem consists in attributing a color to every vertex in such that adjacent vertices receive different colors, every color has a …