default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarlos Rey 0001
Person information
- affiliation (PhD 2022): University of Bologna, Department of Electrical, Electronic and Information Engineering, DEI, Guglielmo Marconi, Italy
Other persons with the same name
- Carlos Rey 0002 — International University of Catalunya, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j9]Laura Galli
, Silvano Martello, Carlos Rodrigo Rey Barra, Paolo Toth:
The quadratic knapsack problem with setup. Comput. Oper. Res. 173: 106873 (2025)- 2023
- [j8]Moisés Silva-Muñoz, Carlos Contreras Bolton, Carlos Rey, Víctor Parada:
Automatic generation of a hybrid algorithm for the maximum independent set problem using genetic programming. Appl. Soft Comput. 144: 110474 (2023) - [j7]Laura Galli, Silvano Martello, Carlos Rey, Paolo Toth:
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem. Discret. Appl. Math. 335: 36-51 (2023) - [j6]Alan Osorio-Mora, Carlos Rey, Paolo Toth, Daniele Vigo:
Effective metaheuristics for the latency location routing problem. Int. Trans. Oper. Res. 30(6): 3801-3832 (2023) - 2022
- [b1]Carlos Rodrigo Rey Barra:
Formulations and Metaheuristics for combinatorial optimization problems. University of Bologna, Italy, 2022 - [c2]Helmer Paz-Orozco, Osman Meléndez-Bermúdez, Jesús González-Feliu, Daniel Morillo, Carlos Rey, Gustavo Gatica:
The Organization of Fruit Collection Transport in Conditions of Extreme Rurality: A Rural CVRP Case. WEA 2022: 234-242 - 2021
- [j5]Laura Galli, Silvano Martello, Carlos Rey, Paolo Toth:
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem. Eur. J. Oper. Res. 291(3): 871-882 (2021) - 2020
- [j4]Nicolás Acevedo, Carlos Rey, Carlos Contreras Bolton, Víctor Parada:
Automatic design of specialized algorithms for the binary knapsack problem. Expert Syst. Appl. 141 (2020) - [c1]Carlos Rey, Paolo Toth, Daniele Vigo:
An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs. SCCC 2020: 1-8
2010 – 2019
- 2018
- [j3]Vittorio Bertolini, Carlos Rey, Mauricio Sepúlveda, Víctor Parada:
Novel Methods Generated by Genetic Programming for the Guillotine-Cutting Problem. Sci. Program. 2018: 6971827:1-6971827:13 (2018) - 2016
- [j2]Carlos Contreras Bolton, Gustavo Gatica, Carlos Rey Barra, Víctor Parada:
A multi-operator genetic algorithm for the generalized minimum spanning tree problem. Expert Syst. Appl. 50: 1-8 (2016) - [j1]Carlos Contreras Bolton, Carlos Rey, Sergio Ramos-Cossio, Claudio Rodríguez, Felipe Gatica, Víctor Parada:
Automatically Produced Algorithms for the Generalized Minimum Spanning Tree Problem. Sci. Program. 2016: 1682925:1-1682925:11 (2016)
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 21:32 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:
