18 citations · 40 across the 4 of their papers we have counts for
4 papers
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…
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 …
Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
Leopoldo E. Cárdenas-Barrón, Rafael A. Melo, Marcio C. Santos
We consider the multi-item inventory lot-sizing problem with supplier selection. The problem consists of determining an optimal purchasing plan in order to satisfy dynamic determin…
Optimal k-fold colorings of webs and antiwebs
Manoel Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura +1
A k-fold x-coloring of a graph is an assignment of (at least) k distinct colors from the set {1, 2, ..., x} to each vertex such that any two adjacent vertices are assigned disjoint…