default search action
Marcio Costa Santos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Mateus C. Silva
, Rafael A. Melo
Obtaining the Grundy chromatic number: How bad can my greedy heuristic coloring be? Comput. Oper. Res. 168: 106703 (2024) - 2022
- [j13]Ruslán G. Marzo
New formulations and branch-and-cut procedures for the longest induced path problem. Comput. Oper. Res. 139: 105627 (2022) - 2021
- [j12]Bonfim Amaro Júnior, Marcio Costa Santos
Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds. Algorithms 14(11): 305 (2021) - [j11]Leopoldo Eduardo Cárdenas-Barrón, Rafael A. Melo
Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection. Comput. Oper. Res. 130: 105234 (2021) - [j10]Rafael A. Melo
A matheuristic approach for the b-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic. Eur. J. Oper. Res. 295(1): 66-81 (2021) - [i5]Rafael A. Melo, Michell F. Queiroz, Marcio Costa Santos:
A matheuristic approach for the $b$-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic. CoRR abs/2102.09696 (2021) - [i4]Ruslán G. Marzo, Rafael A. Melo, Celso C. Ribeiro, Marcio Costa Santos:
New formulations and branch-and-cut procedures for the longest induced path problem. CoRR abs/2104.09227 (2021) - 2020
- [j9]Marcio Costa Santos
Robust inventory theory with perishable products. Ann. Oper. Res. 289(2): 473-494 (2020) - [i3]Leopoldo Eduardo Cárdenas-Barrón, Rafael A. Melo, Marcio Costa Santos:
Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection. CoRR abs/2002.09916 (2020)
2010 – 2019
- 2019
- [j8]Marcio Costa Santos
Proportional and maxmin fairness for the sensor location problem with chance constraints. Discret. Appl. Math. 261: 316-331 (2019) - 2018
- [j7]Marcio Costa Santos
A perfect information lower bound for robust lot-sizing problems. Ann. Oper. Res. 271(2): 887-913 (2018) - 2016
- [b1]Marcio Costa Santos:
Contributions to static and adjustable robust linear optimization. (Contributions à l'optimisation linéaire robuste statique et ajustable). University of Technology of Compiègne, France, 2016 - [j6]Manoel B. Campêlo
Lifted, projected and subgraph-induced inequalities for the representatives k-fold coloring polytope. Discret. Optim. 21: 131-156 (2016) - [j5]Agostinho Agra
A Dynamic Programming Approach for a Class of Robust Optimization Problems. SIAM J. Optim. 26(3): 1799-1823 (2016) - 2015
- [j4]Victor A. Campos, Carlos Vinícius G. C. Lima
The b-chromatic index of graphs. Discret. Math. 338(11): 2072-2079 (2015) - [i2]Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos:
Facet-defining inequalities for the representatives k-fold coloring polytope. CTW 2015: 73-76 - 2013
- [j3]Manoel B. Campêlo
On optimal k-fold colorings of webs and antiwebs. Discret. Appl. Math. 161(1-2): 60-70 (2013) - [j2]Carlos Vinícius G. C. Lima
b-chromatic index of graphs. Electron. Notes Discret. Math. 44: 9-14 (2013) - [j1]Manoel B. Campêlo
On the representatives k-fold coloring polytope. Electron. Notes Discret. Math. 44: 239-244 (2013) - 2011
- [i1]Manoel B. Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura, Marcio Costa Santos:
Optimal k-fold colorings of webs and antiwebs. CoRR abs/1108.5757 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: