default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcos Costa Roboredo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j13]Carlos Leonardo Ramos Póvoa
, Marcos Costa Roboredo, André Soares Velasco, Artur Alves Pessoa, Frederico Galaxe Paes:
A hybrid GRASP and tabu-search heuristic and an exact method for a variant of the multi-compartment vehicle routing problem. Expert Syst. Appl. 259: 125319 (2025)- 2024
- [j12]Marcos Costa Roboredo, Diogo Lima, João Marcos Pereira Silva, Eduardo Uchoa:
Branch-cut-and-price algorithms for two routing problems with hotel selection. Comput. Ind. Eng. 196: 110467 (2024) - [j11]Vinícius Carvalho Soares, Marcos Costa Roboredo:
On the exact solution of the multi-depot open vehicle routing problem. Optim. Lett. 18(4): 1053-1069 (2024) - 2023
- [j10]Marcos Costa Roboredo, Ruslan Sadykov, Eduardo Uchoa:
Solving vehicle routing problems with intermediate stops using VRPSolver models. Networks 81(3): 399-416 (2023) - 2021
- [j9]Brunno e Souza Rodrigues, Carla Martins Floriano, Valdecy Pereira, Marcos Costa Roboredo:
An algorithm to elicitate ELECTRE II, III and IV parameters. Data Technol. Appl. 55(1): 82-96 (2021) - [j8]Gabriela Montenegro Montenegro de Barros, Valdecy Pereira, Marcos Costa Roboredo:
ELECTRE tree: a machine learning approach to infer ELECTRE Tri-B parameters. Data Technol. Appl. 55(4): 586-608 (2021) - 2020
- [j7]Antonio Camargo Andrade de Araújo, Marcos Costa Roboredo, Artur Alves Pessoa, Valdecy Pereira:
Exact methods for the discrete multiple allocation (r|p) hub-centroid problem. Comput. Oper. Res. 116: 104870 (2020)
2010 – 2019
- 2019
- [j6]Marcos Costa Roboredo, Luiz Aizemberg, Artur Alves Pessoa:
An exact approach for the r-interdiction covering problem with fortification. Central Eur. J. Oper. Res. 27(1): 111-131 (2019) - [j5]Marcos Costa Roboredo, Artur Alves Pessoa, Luiz Aizemberg:
An exact approach for the r-interdiction median problem with fortification. RAIRO Oper. Res. 53(2): 505-516 (2019) - 2018
- [j4]José Gentile, Artur Alves Pessoa, Michael Poss, Marcos Costa Roboredo:
Integer programming formulations for three sequential discrete competitive location problems with foresight. Eur. J. Oper. Res. 265(3): 872-881 (2018) - [j3]Hugo Quadros, Marcos Costa Roboredo, Artur Alves Pessoa:
A branch-and-cut algorithm for the multiple allocation r-hub interdiction median problem with fortification. Expert Syst. Appl. 110: 311-322 (2018) - [j2]Eduardo Fagundes Costa, Lidia Angulo Meza, Marcos Costa Roboredo:
A DEA model to evaluate Brazilian container terminals. RAIRO Oper. Res. 52(3): 743-754 (2018) - 2015
- [c1]Marcos Costa Roboredo, Luiz Aizemberg, Lidia Angulo Meza:
The DEA Game Cross Efficiency Model Applied to the Brazilian Football Championship. ITQM 2015: 758-763 - 2013
- [j1]Marcos Costa Roboredo, Artur Alves Pessoa:
A branch-and-cut algorithm for the discrete (r∣p)-centroid problem. Eur. J. Oper. Res. 224(1): 101-109 (2013)
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-11-07 20:34 CET 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:
