default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRicardo Saraiva de Camargo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j19]Allexandre Fortes
, Ricardo Saraiva de Camargo, Leandro Reis Muniz, Fátima Machado de Souza Lima, Fernanda dos Reis Cota:
Efficient matheuristics to solve a rich production-routing problem. Comput. Ind. Eng. 171: 108369 (2022)- [j18]Ricardo M. Campos, Carolina B. Gramcianinov, Ricardo Saraiva de Camargo, Pedro L. da Silva Dias:
Assessment and Calibration of ERA5 Severe Winds in the Atlantic Ocean Using Satellite Data. Remote. Sens. 14(19): 4918 (2022) - 2021
- [j17]Paganini Barcellos de Oliveira, Ricardo Saraiva de Camargo, Gilberto de Miranda Junior, Alexandre Xavier Martins:
A computational study of a decomposition approach for the dynamic two-level uncapacitated facility location problem with single and multiple allocation. Comput. Ind. Eng. 151: 106964 (2021) - [j16]Douglas Moura Miranda, Ricardo Saraiva de Camargo, Samuel Vieira Conceição, Marcelo Franco Porto, Nilson Tadeu Ramos Nunes:
A metaheuristic for the rural school bus routing problem with bell adjustment. Expert Syst. Appl. 180: 115086 (2021) - [j15]Antonio Jose Homsi Goulart, Ricardo Saraiva de Camargo:
On data selection for training wind forecasting neural networks. Comput. Geosci. 155: 104825 (2021) - 2020
- [j14]Paganini Barcellos de Oliveira, Iván A. Contreras, Ricardo Saraiva de Camargo, Gilberto de Miranda Junior:
A comparison of separation routines for benders optimality cuts for two-level facility location problems. Expert Syst. Appl. 141 (2020)
2010 – 2019
- 2018
- [j13]Elisangela Martins de Sá, Reinaldo Morabito, Ricardo Saraiva de Camargo:
Benders decomposition applied to a robust multiple allocation incomplete hub location problem. Comput. Oper. Res. 89: 31-50 (2018) - [j12]Elisangela Martins de Sá, Reinaldo Morabito, Ricardo Saraiva de Camargo:
Efficient Benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements. Expert Syst. Appl. 93: 50-61 (2018) - [j11]Douglas Moura Miranda, Ricardo Saraiva de Camargo, Samuel Vieira Conceição, Marcelo Franco Porto, Nilson Tadeu Ramos Nunes:
A multi-loading school bus routing problem. Expert Syst. Appl. 101: 228-242 (2018) - 2017
- [j10]Fátima Machado Souza Lima, Davi Simões Pereira, Samuel Vieira Conceição, Ricardo Saraiva de Camargo:
A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads. 4OR 15(4): 359-386 (2017) - 2015
- [j9]Elisangela Martins de Sá, Iván A. Contreras, Jean-François Cordeau, Ricardo Saraiva de Camargo, Gilberto de Miranda Jr.:
The Hub Line Location Problem. Transp. Sci. 49(3): 500-518 (2015) - [c2]James F. Campbell, Gilberto de Miranda Jr., Ricardo Saraiva de Camargo, Morton E. O'Kelly:
Hub Location and Network Design with Fixed and Variable Costs. HICSS 2015: 1059-1067 - 2013
- [j8]Odivaney Pedro, Rodney Rezende Saldanha, Ricardo Saraiva de Camargo:
A Tabu Search Approach for the Prize Collecting Traveling Salesman Problem. Electron. Notes Discret. Math. 41: 261-268 (2013) - [j7]Elisangela Martins de Sá, Ricardo Saraiva de Camargo, Gilberto de Miranda Jr.:
An improved Benders decomposition algorithm for the tree of hubs location problem. Eur. J. Oper. Res. 226(2): 185-202 (2013) - [j6]Bruno N. Gomes, Alexandre Xavier Martins, Ricardo Saraiva de Camargo, Jaime A. Ramírez:
An Efficient Genetic Algorithm for the Design of Hub-and-Spoke Networks. IEEE Commun. Lett. 17(4): 793-796 (2013) - 2012
- [j5]Ricardo Saraiva de Camargo, Gilberto de Miranda Jr.:
Single allocation hub location problem under congestion: Network owner and user perspectives. Expert Syst. Appl. 39(3): 3385-3391 (2012) - 2011
- [j4]Ricardo Saraiva de Camargo, Gilberto de Miranda Jr., Ricardo Poley Martins Ferreira:
A hybrid Outer-Approximation/Benders Decomposition algorithm for the single allocation hub location problem under congestion. Oper. Res. Lett. 39(5): 329-337 (2011)
2000 – 2009
- 2009
- [j3]Ricardo Saraiva de Camargo, Gilberto de Miranda Jr., Ricardo Poley Martins Ferreira, Henrique Pacca Loureiro Luna:
Multiple allocation hub-and-spoke network design under hub congestion. Comput. Oper. Res. 36(12): 3097-3106 (2009) - [j2]Ricardo Saraiva de Camargo, Gilberto de Miranda Jr., Henrique Pacca Loureiro Luna:
Benders Decomposition for Hub Location Problems with Economies of Scale. Transp. Sci. 43(1): 86-97 (2009) - 2008
- [j1]Ricardo Saraiva de Camargo, Gilberto de Miranda Jr., Henrique Pacca Loureiro Luna:
Benders decomposition for the uncapacitated multiple allocation hub location problem. Comput. Oper. Res. 35(4): 1047-1064 (2008) - 2007
- [b1]Ricardo Saraiva de Camargo:
Sistemas eixo-raio de múltipla atribuição: modelos e algoritmos. Federal University of Minas Gerais, Brazil, 2007 - [c1]João F. M. Sarubbi, Henrique Pacca Loureiro Luna, Gilberto de Miranda Jr., Ricardo Saraiva de Camargo:
Computing Sharp Lower and Upper Bounds for the Minimum Latency Problem. HIS 2007: 71-77
Coauthor Index
aka: Gilberto de Miranda Junior
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-10-07 22:20 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:
