Rafael A. Melo

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 28

Top Topics

Iterated Local Search

Valid Inequalities

Integer Programming

Top Venues

Comput. Oper. Res.

Comput. Ind. Eng.

Eur. J. Oper. Res.

Publications

Vitor A. A. Souza, Rafael A. Melo, Geraldo R. Mateus
The Vehicle Routing Problem with Cross-Docking and Scheduling at the Docking Station: Compact formulation and a General Variable Neighborhood Search metaheuristic. Appl. Soft Comput. 161 (2024)
Mateus C. Silva, Rafael A. Melo, Mauricio G. C. Resende, Marcio Costa Santos, Rodrigo F. Toso
Obtaining the Grundy chromatic number: How bad can my greedy heuristic coloring be? Comput. Oper. Res. 168 (2024)
Rafael A. Melo, Celso C. Ribeiro
MIP formulations for induced graph optimization problems: a tutorial. Int. Trans. Oper. Res. 30 (6) (2023)
Rafael A. Melo, Celso C. Ribeiro, José A. Riveaux
The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study. Inf. Sci. 612 (2022)
Rafael A. Melo, Celso C. Ribeiro
Maximum weighted induced forests and trees: new formulations and a computational comparative review. Int. Trans. Oper. Res. 29 (4) (2022)
Ruslán G. Marzo, Rafael A. Melo, Celso C. Ribeiro, Marcio Costa Santos
New formulations and branch-and-cut procedures for the longest induced path problem. Comput. Oper. Res. 139 (2022)
Jesus O. Cunha, Geraldo R. Mateus, Rafael A. Melo
A hybrid heuristic for capacitated three-level lot-sizing and replenishment problems with a distribution structure. Comput. Ind. Eng. 173 (2022)
Rafael A. Melo, Michell F. Queiroz, Marcio Costa Santos
A matheuristic approach for the b-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic. Eur. J. Oper. Res. 295 (1) (2021)
Rafael A. Melo, Celso C. Ribeiro
Maximum weighted induced forests and trees: New formulations and a computational comparative review. CoRR (2021)
Rafael A. Melo, Michell F. Queiroz, Celso C. Ribeiro
Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem. Eur. J. Oper. Res. 289 (1) (2021)
Ruslán G. Marzo, Rafael A. Melo, Celso C. Ribeiro, Marcio Costa Santos
New formulations and branch-and-cut procedures for the longest induced path problem. CoRR (2021)
Leopoldo Eduardo Cárdenas-Barrón, Rafael A. Melo, Marcio Costa Santos
Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection. Comput. Oper. Res. 130 (2021)
Willian C. S. Martinho, Rafael A. Melo, Kenneth Sörensen
An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization. Comput. Oper. Res. 135 (2021)
Jesus O. Cunha, Hugo Harry Kramer, Rafael A. Melo
On the computational complexity of uncapacitated multi-plant lot-sizing problems. Optim. Lett. 15 (2) (2021)
Jesus O. Cunha, Rafael A. Melo
Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure. Eur. J. Oper. Res. 295 (3) (2021)
Rafael A. Melo, Michell F. Queiroz, Marcio Costa Santos
A matheuristic approach for the $b$-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic. CoRR (2021)
Leopoldo Eduardo Cárdenas-Barrón, Rafael A. Melo, Marcio Costa Santos
Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection. CoRR (2020)
Leopoldo Eduardo Cárdenas-Barrón, Rafael A. Melo
A fast and effective MIP-based heuristic for a selective and periodic inventory routing problem in reverse logistics. CoRR (2020)
Jesus O. Cunha, Rafael A. Melo
New approaches for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure. CoRR (2020)
Jesus O. Cunha, Hugo Harry Kramer, Rafael A. Melo
On the computational complexity of uncapacitated multi-plant lot-sizing problems. CoRR (2020)
Willian C. S. Martinho, Rafael A. Melo, Kenneth Sörensen
An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization. CoRR (2020)
Jesus O. Cunha, Hugo Harry Kramer, Rafael A. Melo
Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing. Comput. Oper. Res. 104 (2019)
Rafael A. Melo, Celso C. Ribeiro
Formulations and heuristics for the multi-item uncapacitated lot-sizing problem with inventory bounds. Int. J. Prod. Res. 55 (2) (2017)
Jesus O. Cunha, Rafael A. Melo
On reformulations for the one-warehouse multi-retailer problem. Ann. Oper. Res. 238 (1-2) (2016)
Rafael A. Melo, Phillippe Samer, Sebastián Urrutia
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices. Comput. Optim. Appl. 65 (3) (2016)
Jesus O. Cunha, Rafael A. Melo
A computational comparison of formulations for the economic lot-sizing with remanufacturing. Comput. Ind. Eng. 92 (2016)
Rafael A. Melo, Celso C. Ribeiro
Improved solutions for the freight consolidation and containerization problem using aggregation and symmetry breaking. Comput. Ind. Eng. 85 (2015)
Rafael A. Melo, Phillippe Samer, Sebastián Urrutia
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices. CoRR (2015)
Rafael A. Melo, Laurence A. Wolsey
MIP formulations and heuristics for two-level production-transportation problems. Comput. Oper. Res. 39 (11) (2012)
Rafael A. Melo, Laurence A. Wolsey
Uncapacitated two-level lot-sizing. Oper. Res. Lett. 38 (4) (2010)
Rafael A. Melo, Laurence A. Wolsey
Optimizing production and transportation in a commit-to-delivery business mode. Eur. J. Oper. Res. 203 (3) (2010)
Rafael A. Melo, Sebastián Urrutia, Celso C. Ribeiro
The traveling tournament problem with predefined venues. J. Sched. 12 (6) (2009)
Sebastián Urrutia, Celso C. Ribeiro, Rafael A. Melo
A New Lower Bound to the Traveling Tournament Problem. CISched (2007)