default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaudio Barbieri Cunha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Claudio Barbieri Cunha
, Dieferson Flori Massarotto, Sergio Luiz Fornazza, André Bergsten Mendes:
An ALNS metaheuristic for the family multiple traveling salesman problem. Comput. Oper. Res. 169: 106750 (2024)- 2023
- [j13]Luiz Augusto C. G. Andrade, Claudio Barbieri Cunha:
Disaggregated retail forecasting: A gradient boosting approach. Appl. Soft Comput. 141: 110283 (2023) - [j12]Gustavo de Abreu Rodrigues, Claudio Barbieri Cunha, Luigi Guarino Neto, José Geraldo Vidal Vieira:
An adaptive large neighborhood search metaheuristic for the Generalized Bin Packing problem with incompatible categories. Comput. Ind. Eng. 185: 109586 (2023) - [j11]Antonio Carlos Bonassa, Claudio Barbieri da Cunha, Cassiano Augusto Isler:
A multi-start local search heuristic for the multi-period auto-carrier loading and transportation problem in Brazil. Eur. J. Oper. Res. 307(1): 193-211 (2023) - 2021
- [j10]Renato Arbex, Claudio Barbieri da Cunha, Roberto Speicys Cardoso:
Before-and-after evaluation of a bus network improvement using performance indicators from historical smart card data. Public Transp. 13(3): 483-501 (2021)
2010 – 2019
- 2019
- [j9]Antonio Carlos Bonassa, Claudio Barbieri da Cunha, Cassiano Augusto Isler:
An exact formulation for the multi-period auto-carrier loading and transportation problem in Brazil. Comput. Ind. Eng. 129: 144-155 (2019) - [j8]Luiz F. O. Moura Santos, Renan Sallai Iwayama, Luísa Brandão Cavalcanti, Leandro Maciel Turi, Fabio Emanuel de Souza Morais, Gabriel Mormilho, Claudio Barbieri da Cunha:
A variable neighborhood search algorithm for the bin packing problem with compatible categories. Expert Syst. Appl. 124: 209-225 (2019) - [i1]Luiz F. O. Moura Santos, Hugo T. Yoshida Yoshizaki, Claudio Barbieri da Cunha:
Variable Neighborhood Search for the Bin Packing Problem with Compatible Categories. CoRR abs/1905.03427 (2019) - 2017
- [j7]Marcos Roberto Silva, Claudio Barbieri da Cunha:
A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem. Eur. J. Oper. Res. 262(3): 954-965 (2017) - 2016
- [j6]Michel Povlovitsch Seixas, André Bergsten Mendes, Marcos Ribeiro Pereira Barretto, Claudio Barbieri Cunha, Marco Antonio Brinati, Roberto Edward Cruz, Yue Wu, Philip A. Wilson:
A heuristic approach to stowing general cargo into platform supply vessels. J. Oper. Res. Soc. 67(1): 148-158 (2016) - 2015
- [j5]Luiz Augusto C. G. Andrade, Claudio Barbieri da Cunha:
An ABC heuristic for optimizing moveable ambulance station location and vehicle repositioning for the city of São Paulo. Int. Trans. Oper. Res. 22(3): 473-501 (2015)
2000 – 2009
- 2009
- [j4]Marcos Roberto Silva, Claudio Barbieri da Cunha:
New simple and efficient heuristics for the uncapacitated single allocation hub location problem. Comput. Oper. Res. 36(12): 3152-3165 (2009) - 2007
- [j3]Claudio Barbieri Cunha, Fernando Mutarelli:
A spreadsheet-based optimization model for the integrated problem of producing and distributing a major weekly newsmagazine. Eur. J. Oper. Res. 176(2): 925-940 (2007) - [j2]Claudio Barbieri da Cunha, Marcos Roberto Silva:
A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil. Eur. J. Oper. Res. 179(3): 747-758 (2007) - 2005
- [j1]Ravindra K. Ahuja, Claudio Barbieri da Cunha:
Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem. J. Heuristics 11(5-6): 465-481 (2005)
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-10-07 22:19 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:
