Rafael A. Melo

About Rafael A. Melo

Rafael A. Melo, With an exceptional h-index of 13 and a recent h-index of 12 (since 2020), a distinguished researcher at Universidade Federal da Bahia, specializes in the field of Operations Research, Mathematical Programming, Combinatorial Optimization, Metaheuristics, Graph Theory.

His recent articles reflect a diverse array of research interests and contributions to the field:

MIP formulations for induced graph optimization problems: a tutorial

A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem

Algoritmos genéticos de chaves aleatórias enviesadas para o problema da coloração de Grundy

O problema de coleta e entrega com janelas de tempo e escalonamento nas arestas

Novas invariantes para 1-fatorações do grafo K2n

Formulações de programação inteira para o problema da coloração de Grundy

A hybrid heuristic for capacitated three-level lot-sizing and replenishment problems with a distribution structure

The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study

Rafael A. Melo Information

University

Position

Brazil

Citations(all)

485

Citations(since 2020)

313

Cited By

288

hIndex(all)

13

hIndex(since 2020)

12

i10Index(all)

15

i10Index(since 2020)

12

Email

University Profile Page

Google Scholar

Rafael A. Melo Skills & Research Interests

Operations Research

Mathematical Programming

Combinatorial Optimization

Metaheuristics

Graph Theory

Top articles of Rafael A. Melo

MIP formulations for induced graph optimization problems: a tutorial

2023/11

A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem

Annals of Operations Research

2023/9/28

Algoritmos genéticos de chaves aleatórias enviesadas para o problema da coloração de Grundy

2023

O problema de coleta e entrega com janelas de tempo e escalonamento nas arestas

2023

Novas invariantes para 1-fatorações do grafo K2n

2023

Formulações de programação inteira para o problema da coloração de Grundy

2023

A hybrid heuristic for capacitated three-level lot-sizing and replenishment problems with a distribution structure

Computers & Industrial Engineering

2022/11/1

The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study

Information Sciences

2022/10/1

Maximum weighted induced forests and trees: new formulations and a computational comparative review

2022/7

New formulations and branch-and-cut procedures for the longest induced path problem

Computers & Operations Research

2022/3/1

Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure

European Journal of Operational Research

2021/12/16

A matheuristic approach for the b-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic

European Journal of Operational Research

2021/11/16

An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization

Computers & Operations Research

2021/11/1

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

Omega

2021/9/1

Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection

Computers & Operations Research

2021/6/1

On the computational complexity of uncapacitated multi-plant lot-sizing problems

Optimization Letters

2021

Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem

European Journal of Operational Research

2021/2/16

See List of Professors in Rafael A. Melo University(Universidade Federal da Bahia)

Co-Authors

academic-engine