Marcio Costa Santos


Research areas:
  • Combinatorial Optimization
  • Optimization under uncertainty
  • Robust Optimization
  • Operacions Research
  • Graph Theory
Degrees:

PhD,  Robust Optimization, Universitè de Technologie de Compiègne, UTC, França

 

Room: 4322
Phone:
marciocs@dcc.ufmg.br

Home page    Lattes    Google scholar 


Information extracted from Lattes platform

Last update: 2023/09/14


Current projects

2022 a AtualUma abordagem teórica e aplicada a problemas combinatórios em redes sociais

Integrantes: Vinicius Gomes Lima (coordenador), Marcio Costa Santos, Tatiane Fernandes Figueiredo, Pablo Luiz Braga Soares.

Current applied research projects

See all projects in Lattes

Recent publications

Articles in journals

Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
2021. COMPUTERS & OPERATIONS RESEARCH.
A matheuristic approach for the
2021. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH.
New formulations and branch-and-cut procedures for the longest induced path problem
2021. COMPUTERS & OPERATIONS RESEARCH.
Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds
2021. Algorithms.
Proportional and maxmin fairness for the sensor location problem with chance constraints
2019. DISCRETE APPLIED MATHEMATICS.
Robust inventory theory with perishable products
2019. Annals of Operations Research.
Lifted, projected and subgraph-induced inequalities for the representatives
2016. Discrete Optimization.
A Dynamic Programming Approach for a Class of Robust Optimization Problems
2016. SIAM JOURNAL ON OPTIMIZATION.

Papers in conferences

Applications of checkpoint allocation in Covid context
2022. 54º SBPO - LIV Simpósio Brasileiro de Pesquisa Operacional.
Abordagens evolutivas para determinação do caminho de corte de um leiaute com tempo mínimo
2020. Simpósio Brasileiro de Pesquisa Operacional (SBPO 2020).
b-chromatic index of graphs
2013. VII Latin-American Algorithms, Graphs and Optimization Symposium. 2
The k-th Chromatic Number of Webs and Antiwebs
2011. XLIII Simpósio Brasileiro de Pesquisa Operacional (SBPO).

Extended abstracts in conferences

Coloração harmoniosa
2022. 7º Encontro de Teoria da Computação, 2022.
On the representatives k-fold coloring polytope
2013. VII Latin-American Algorithms, Graphs and Optimization Symposium.

Abstracts in conferences

Parametrização de um Algoritmo Genético para o Problema do Corte Máximo
2022. V Encontro de Computação do Oeste Potiguar.

See all publications in Lattes

Current students

MS

Mateus Carvalho da Silva. Grundy graph colorings: formulations, heuristics, and combinatorial bounds. Início: 2023. Universidade Federal da Bahia (Co orientador)
Ana Beatriz da Silveira Martins. Coloração harmoniosa. Início: 2023. Universidade Federal do Ceará (Co orientador)

PhD

Pedro Paulo de Medeiros.. A definir. Início: 2020. Universidade Federal do Ceará (Co orientador)

See all students in Lattes
Skip to content