Rafael A. Melo

Orcid: 0000-0003-4300-0097

According to our database1, Rafael A. Melo authored at least 26 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Obtaining the Grundy chromatic number: How bad can my greedy heuristic coloring be?
Comput. Oper. Res., 2024

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., 2024

2023
MIP formulations for induced graph optimization problems: a tutorial.
Int. Trans. Oper. Res., November, 2023

2022
Maximum weighted induced forests and trees: new formulations and a computational comparative review.
Int. Trans. Oper. Res., 2022

The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study.
Inf. Sci., 2022

New formulations and branch-and-cut procedures for the longest induced path problem.
Comput. Oper. Res., 2022

A hybrid heuristic for capacitated three-level lot-sizing and replenishment problems with a distribution structure.
Comput. Ind. Eng., 2022

2021
On the computational complexity of uncapacitated multi-plant lot-sizing problems.
Optim. Lett., 2021

A matheuristic approach for the b-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic.
Eur. J. Oper. Res., 2021

Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem.
Eur. J. Oper. Res., 2021

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., 2021

An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization.
Comput. Oper. Res., 2021

Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection.
Comput. Oper. Res., 2021

2020
New approaches for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure.
CoRR, 2020

A fast and effective MIP-based heuristic for a selective and periodic inventory routing problem in reverse logistics.
CoRR, 2020

2019
Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing.
Comput. Oper. Res., 2019

2017
Formulations and heuristics for the multi-item uncapacitated lot-sizing problem with inventory bounds.
Int. J. Prod. Res., 2017

2016
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices.
Comput. Optim. Appl., 2016

A computational comparison of formulations for the economic lot-sizing with remanufacturing.
Comput. Ind. Eng., 2016

On reformulations for the one-warehouse multi-retailer problem.
Ann. Oper. Res., 2016

2015
Improved solutions for the freight consolidation and containerization problem using aggregation and symmetry breaking.
Comput. Ind. Eng., 2015

2012
MIP formulations and heuristics for two-level production-transportation problems.
Comput. Oper. Res., 2012

2010
Uncapacitated two-level lot-sizing.
Oper. Res. Lett., 2010

Optimizing production and transportation in a commit-to-delivery business mode.
Eur. J. Oper. Res., 2010

2009
The traveling tournament problem with predefined venues.
J. Sched., 2009

2007
A New Lower Bound to the Traveling Tournament Problem.
Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007


  Loading...