32 citations · 100 across the 10 of their papers we have counts for
10 papers
A hybrid heuristic for capacitated three-level lot-sizing and replenishment problems with a distribution structure
Jesus O. Cunha, Geraldo R. Mateus, Rafael A. Melo
We consider the capacitated three-level lot-sizing and replenishment problem with a distribution structure (3LSPD-C), recently proposed in the literature. In 3LSPD-C, a single prod…
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 …
Maximum weighted induced forests and trees: New formulations and a computational comparative review
Rafael A. Melo, Celso C. Ribeiro
Given a graph with a weight associated with each vertex , the maximum weighted induced forest problem (MWIF) consists of encountering a maximum weighted sub…
Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure
Jesus O. Cunha, Rafael A. Melo
We consider the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure. In this NP-hard problem, a single production plant sends the produced…
An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization
Willian C. S. Martinho, Rafael A. Melo, Kenneth Sörensen
The gravity fed water distribution network design (WDND) optimization problem consists in determining the pipe diameters of a water network such that hydraulic constraints are sati…
A fast and effective MIP-based heuristic for a selective and periodic inventory routing problem in reverse logistics
Leopoldo E. Cárdenas-Barrón, Rafael A. Melo
We consider an NP-hard selective and periodic inventory routing problem (SPIRP) in a waste vegetable oil collection environment. This SPIRP arises in the context of reverse logisti…
On the computational complexity of uncapacitated multi-plant lot-sizing problems
J. O. Cunha, H. H. Kramer, R. A. Melo
Production and inventory planning have become crucial and challenging in nowadays competitive industrial and commercial sectors, especially when multiple plants or warehouses are i…
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…
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 , the minimum branch vertices problem consists in finding a spanning tree of minimizing the number of vertices with degree greater than two. W…