9 citations · 9 across the 1 of their papers we have counts for
5 papers
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 …
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…
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…