A New Lower Bound to the Traveling Tournament Problem. - Sebastián Urrutia; Celso C. Ribeiro; Rafael A. Melo (CISched, 2007)

The traveling tournament problem with predefined venues. - Rafael A. Melo; Sebastián Urrutia; Celso C. Ribeiro (J. Sched., 2009)

Optimizing production and transportation in a commit-to-delivery business mode. - Rafael A. Melo; Laurence A. Wolsey (Eur. J. Oper. Res., 2010)

Uncapacitated two-level lot-sizing. - Rafael A. Melo; Laurence A. Wolsey (Oper. Res. Lett., 2010)

MIP formulations and heuristics for two-level production-transportation problems. - Rafael A. Melo; Laurence A. Wolsey (Comput. Oper. Res., 2012)

Improved solutions for the freight consolidation and containerization problem using aggregation and symmetry breaking. - Rafael A. Melo; Celso C. Ribeiro (Comput. Ind. Eng., 2015)

On reformulations for the one-warehouse multi-retailer problem. - Jesus O. Cunha; Rafael A. Melo (Ann. Oper. Res., 2016)

A computational comparison of formulations for the economic lot-sizing with remanufacturing. - Jesus O. Cunha; Rafael A. Melo (Comput. Ind. Eng., 2016)

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 (Comput. Optim. Appl., 2016)

Formulations and heuristics for the multi-item uncapacitated lot-sizing problem with inventory bounds. - Rafael A. Melo; Celso C. Ribeiro (Int. J. Prod. Res., 2017)

Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing. - Jesus O. Cunha; Hugo Harry Kramer; Rafael A. Melo (Comput. Oper. Res., 2019)

A fast and effective MIP-based heuristic for a selective and periodic inventory routing problem in reverse logistics. - Leopoldo Eduardo Cárdenas-Barrón; Rafael A. Melo (CoRR, 2020)

New approaches for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure. - Jesus O. Cunha; Rafael A. Melo (CoRR, 2020)

Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection. - Leopoldo Eduardo Cárdenas-Barrón; Rafael A. Melo; Marcio Costa Santos (Comput. Oper. Res., 2021)

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 (Comput. Oper. Res., 2021)

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 (Eur. J. Oper. Res., 2021)

Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem. - Rafael A. Melo; Michell F. Queiroz; Celso C. Ribeiro (Eur. J. Oper. Res., 2021)

A matheuristic approach for the b-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic. - Rafael A. Melo; Michell F. Queiroz; Marcio Costa Santos (Eur. J. Oper. Res., 2021)

On the computational complexity of uncapacitated multi-plant lot-sizing problems. - Jesus O. Cunha; Hugo Harry Kramer; Rafael A. Melo (Optim. Lett., 2021)

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 (Comput. Ind. Eng., 2022)

New formulations and branch-and-cut procedures for the longest induced path problem. - Ruslán G. Marzo; Rafael A. Melo; Celso C. Ribeiro; Marcio Costa Santos (Comput. Oper. Res., 2022)

The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study. - Rafael A. Melo; Celso C. Ribeiro; José A. Riveaux (Inf. Sci., 2022)

Maximum weighted induced forests and trees: new formulations and a computational comparative review. - Rafael A. Melo; Celso C. Ribeiro (Int. Trans. Oper. Res., 2022)

MIP formulations for induced graph optimization problems: a tutorial. - Rafael A. Melo; Celso C. Ribeiro (Int. Trans. Oper. Res., 2023)

The Vehicle Routing Problem with Cross-Docking and Scheduling at the Docking Station: Compact formulation and a General Variable Neighborhood Search metaheuristic. - Vitor A. A. Souza; Rafael A. Melo; Geraldo R. Mateus (Appl. Soft Comput., 2024)

Obtaining the Grundy chromatic number: How bad can my greedy heuristic coloring be? - Mateus C. Silva; Rafael A. Melo; Mauricio G. C. Resende; Marcio Costa Santos; Rodrigo F. Toso (Comput. Oper. Res., 2024)

The connected Grundy coloring problem: Formulations and a local-search enhanced biased random-key genetic algorithm. - Mateus C. Silva; Rafael A. Melo; Mauricio G. C. Resende; Marcio Costa Santos; Rodrigo F. Toso (CoRR, 2024)

The connected Grundy coloring problem: Formulations and a local-search enhanced biased random-key genetic algorithm. - Mateus C. Silva; Rafael A. Melo; Mauricio G. C. Resende; Marcio C. Santos; Rodrigo F. Toso (Comput. Oper. Res., 2025)

A logic-based Benders decomposition approach for a fuel delivery problem with time windows, unsplit compartments, and split deliveries. - Rafael A. Melo; Celso C. Ribeiro; Sebastián Urrutia; Pieter Vansteenwegen (Eur. J. Oper. Res., 2025)

A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem. - Rafael A. Melo; Celso C. Ribeiro; José A. Riveaux (Ann. Oper. Res., 2025)