Rafael A. Melo

39 papers Journal 38Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Nested logic-based Benders decomposition for an integrated home healthcare problem.
Eur. J. Oper. Res.
Abdalrahman Algendi, Sebastián Urrutia, Lars Magnus Hvattum, Rafael A. Melo
2025 J jnl
A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem.
Ann. Oper. Res.
Rafael A. Melo, Celso C. Ribeiro, José A. Riveaux
2025 J jnl
A logic-based Benders decomposition approach for a fuel delivery problem with time windows, unsplit compartments, and split deliveries.
Eur. J. Oper. Res.
Rafael A. Melo, Celso C. Ribeiro, Sebastián Urrutia, Pieter Vansteenwegen
2025 J jnl
Constraint programming model and biased random-key genetic algorithm for the single-machine coupled task scheduling problem with exact delays to minimize the makespan.
CoRR
Vítor A. Barbosa, Rafael A. Melo
2025 J jnl
The connected Grundy coloring problem: Formulations and a local-search enhanced biased random-key genetic algorithm.
Comput. Oper. Res.
Mateus C. Silva, Rafael A. Melo, Mauricio G. C. Resende, Marcio Costa Santos, Rodrigo F. Toso
2024 J jnl
Obtaining the Grundy chromatic number: How bad can my greedy heuristic coloring be?
Comput. Oper. Res.
Mateus C. Silva, Rafael A. Melo, Mauricio G. C. Resende, Marcio Costa Santos, Rodrigo F. Toso
2024 J jnl
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.
Vitor A. A. Souza, Rafael A. Melo, Geraldo R. Mateus
2024 J jnl
The connected Grundy coloring problem: Formulations and a local-search enhanced biased random-key genetic algorithm.
CoRR
Mateus C. Silva, Rafael A. Melo, Mauricio G. C. Resende, Marcio Costa Santos, Rodrigo F. Toso
2023 J jnl
MIP formulations for induced graph optimization problems: a tutorial.
Int. Trans. Oper. Res.
Rafael A. Melo, Celso C. Ribeiro
2022 J jnl
A hybrid heuristic for capacitated three-level lot-sizing and replenishment problems with a distribution structure.
Comput. Ind. Eng.
Jesus O. Cunha, Geraldo R. Mateus, Rafael A. Melo
2022 J jnl
Maximum weighted induced forests and trees: new formulations and a computational comparative review.
Int. Trans. Oper. Res.
Rafael A. Melo, Celso C. Ribeiro
2022 J jnl
New formulations and branch-and-cut procedures for the longest induced path problem.
Comput. Oper. Res.
Ruslán G. Marzo, Rafael A. Melo, Celso C. Ribeiro, Marcio Costa Santos
2022 J jnl
The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study.
Inf. Sci.
Rafael A. Melo, Celso C. Ribeiro, José A. Riveaux
2021 J jnl
A matheuristic approach for the $b$-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic.
CoRR
Rafael A. Melo, Michell F. Queiroz, Marcio Costa Santos
2021 J jnl
A matheuristic approach for the b-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic.
Eur. J. Oper. Res.
Rafael A. Melo, Michell F. Queiroz, Marcio Costa Santos
2021 J jnl
An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization.
Comput. Oper. Res.
Willian C. S. Martinho, Rafael A. Melo, Kenneth Sörensen
2021 J jnl
Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem.
Eur. J. Oper. Res.
Rafael A. Melo, Michell F. Queiroz, Celso C. Ribeiro
2021 J jnl
Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection.
Comput. Oper. Res.
Leopoldo Eduardo Cárdenas-Barrón, Rafael A. Melo, Marcio Costa Santos
2021 J jnl
Maximum weighted induced forests and trees: New formulations and a computational comparative review.
CoRR
Rafael A. Melo, Celso C. Ribeiro
2021 J jnl
New formulations and branch-and-cut procedures for the longest induced path problem.
CoRR
Ruslán G. Marzo, Rafael A. Melo, Celso C. Ribeiro, Marcio Costa Santos
2021 J jnl
On the computational complexity of uncapacitated multi-plant lot-sizing problems.
Optim. Lett.
Jesus O. Cunha, Hugo Harry Kramer, Rafael A. Melo
2021 J jnl
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.
Jesus O. Cunha, Rafael A. Melo
2020 J jnl
A fast and effective MIP-based heuristic for a selective and periodic inventory routing problem in reverse logistics.
CoRR
Leopoldo Eduardo Cárdenas-Barrón, Rafael A. Melo
2020 J jnl
An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization.
CoRR
Willian C. S. Martinho, Rafael A. Melo, Kenneth Sörensen
2020 J jnl
Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection.
CoRR
Leopoldo Eduardo Cárdenas-Barrón, Rafael A. Melo, Marcio Costa Santos
2020 J jnl
New approaches for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure.
CoRR
Jesus O. Cunha, Rafael A. Melo
2020 J jnl
On the computational complexity of uncapacitated multi-plant lot-sizing problems.
CoRR
Jesus O. Cunha, Hugo Harry Kramer, Rafael A. Melo
2019 J jnl
Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing.
Comput. Oper. Res.
Jesus O. Cunha, Hugo Harry Kramer, Rafael A. Melo
2017 J jnl
Formulations and heuristics for the multi-item uncapacitated lot-sizing problem with inventory bounds.
Int. J. Prod. Res.
Rafael A. Melo, Celso C. Ribeiro
2016 J jnl
A computational comparison of formulations for the economic lot-sizing with remanufacturing.
Comput. Ind. Eng.
Jesus O. Cunha, Rafael A. Melo
2016 J jnl
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices.
Comput. Optim. Appl.
Rafael A. Melo, Phillippe Samer, Sebastián Urrutia
2016 J jnl
On reformulations for the one-warehouse multi-retailer problem.
Ann. Oper. Res.
Jesus O. Cunha, Rafael A. Melo
2015 J jnl
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices.
CoRR
Rafael A. Melo, Phillippe Samer, Sebastián Urrutia
2015 J jnl
Improved solutions for the freight consolidation and containerization problem using aggregation and symmetry breaking.
Comput. Ind. Eng.
Rafael A. Melo, Celso C. Ribeiro
2012 J jnl
MIP formulations and heuristics for two-level production-transportation problems.
Comput. Oper. Res.
Rafael A. Melo, Laurence A. Wolsey
2010 J jnl
Optimizing production and transportation in a commit-to-delivery business mode.
Eur. J. Oper. Res.
Rafael A. Melo, Laurence A. Wolsey
2010 J jnl
Uncapacitated two-level lot-sizing.
Oper. Res. Lett.
Rafael A. Melo, Laurence A. Wolsey
2009 J jnl
The traveling tournament problem with predefined venues.
J. Sched.
Rafael A. Melo, Sebastián Urrutia, Celso C. Ribeiro
2007 — conf
A New Lower Bound to the Traveling Tournament Problem.
CISched
Sebastián Urrutia, Celso C. Ribeiro, Rafael A. Melo