Marcio Costa Santos

Orcid: 0000-0002-5452-0226

According to our database1, Marcio Costa Santos authored at least 15 papers between 2013 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

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

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

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

2020
Robust inventory theory with perishable products.
Ann. Oper. Res., 2020

2019
Proportional and maxmin fairness for the sensor location problem with chance constraints.
Discret. Appl. Math., 2019

2018
A perfect information lower bound for robust lot-sizing problems.
Ann. Oper. Res., 2018

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

A Dynamic Programming Approach for a Class of Robust Optimization Problems.
SIAM J. Optim., 2016

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

2015
The b-chromatic index of graphs.
Discret. Math., 2015

Facet-defining inequalities for the representatives k-fold coloring polytope.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2013
b-chromatic index of graphs.
Electron. Notes Discret. Math., 2013

On the representatives k-fold coloring polytope.
Electron. Notes Discret. Math., 2013

On optimal k-fold colorings of webs and antiwebs.
Discret. Appl. Math., 2013


  Loading...