Marcio Costa Santos

According to our database, Marcio Costa Santos authored at least 17 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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

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

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

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

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

Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds.

Bonfim Amaro Júnior, Marcio Costa Santos, Guilherme Nepomuceno de Carvalho, Luiz Jonatã Pires de Araújo, Plácido Rogério Pinheiro

Algorithms, 2021

2020

Robust inventory theory with perishable products.

Marcio Costa Santos, Agostinho Agra, Michael Poss

Ann. Oper. Res., 2020

2019

Proportional and maxmin fairness for the sensor location problem with chance constraints.

Marcio Costa Santos, Hannan Luss, Dritan Nace, Michael Poss

Discret. Appl. Math., 2019

2018

A perfect information lower bound for robust lot-sizing problems.

Marcio Costa Santos, Michael Poss, Dritan Nace

Ann. Oper. Res., 2018

2016

Contributions to static and adjustable robust linear optimization. (Contributions à l'optimisation linéaire robuste statique et ajustable).

Marcio Costa Santos

PhD thesis, 2016

A Dynamic Programming Approach for a Class of Robust Optimization Problems.

Agostinho Agra, Marcio Costa Santos, Dritan Nace, Michael Poss

SIAM J. Optim., 2016

Lifted, projected and subgraph-induced inequalities for the representatives k-fold coloring polytope.

Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos

Discret. Optim., 2016

2015

The b-chromatic index of graphs.

Victor A. Campos, Carlos Vinícius G. C. Lima, Nicolas Almeida Martins, Leonardo Sampaio Rocha, Marcio Costa Santos, Ana Silva

Discret. Math., 2015

Facet-defining inequalities for the representatives k-fold coloring polytope.

Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2013

b-chromatic index of graphs.

Carlos Vinícius G. C. Lima, Nicolas Almeida Martins, Leonardo Sampaio Rocha, Marcio Costa Santos, Ana Silva

Electron. Notes Discret. Math., 2013

On the representatives k-fold coloring polytope.

Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos

Electron. Notes Discret. Math., 2013

On optimal k-fold colorings of webs and antiwebs.

Manoel B. Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura, Marcio Costa Santos

Discret. Appl. Math., 2013