default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeandro Resende Mundim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]André Kubagawa Sato
, Leandro Resende Mundim, Thiago de Castro Martins, Marcos de Sales Guerra Tsuzuki:
A separation and compaction algorithm for the two-open dimension nesting problem using penetration-fit raster and obstruction map. Expert Syst. Appl. 220: 119716 (2023)- 2020
- [j5]Thiago Alves de Queiroz, Leandro Resende Mundim:
Multiobjective pseudo-variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time. Int. Trans. Oper. Res. 27(3): 1478-1500 (2020) - [c5]Moisés Rocha dos Santos, Leandro Resende Mundim, André C. P. L. F. de Carvalho:
Evaluation of Error Metrics for Meta-learning Label Definition in the Forecasting Task. HAIS 2020: 397-409
2010 – 2019
- 2019
- [c4]Douglas Castilho, João Gama, Leandro Resende Mundim, André C. P. L. F. de Carvalho:
Improving Portfolio Optimization Using Weighted Link Prediction in Dynamic Stock Networks. ICCS (3) 2019: 340-353 - [c3]Thiago Alves de Queiroz, Leandro Resende Mundim, André Carlos Ponce de Leon Ferreira de Carvalho:
Multi-objective Basic Variable Neighborhood Search for Portfolio Selection. ICVNS 2019: 67-80 - 2018
- [j4]Leandro Resende Mundim, Thiago Alves de Queiroz:
Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem. Electron. Notes Discret. Math. 66: 127-134 (2018) - [j3]Leandro Resende Mundim, Marina Andretta, Maria Antónia Carravilla, José Fernando Oliveira:
A general heuristic for two-dimensional nesting problems with limited-size containers. Int. J. Prod. Res. 56(1-2): 709-732 (2018) - [c2]Layane Rodrigues de Souza Queiroz, Leandro Resende Mundim, Marina Andretta:
Genetic Algorithm for the Knapsack Problem with Irregular Shaped Items. CLEI 2018: 192-199 - 2017
- [j2]Leandro Resende Mundim, Marina Andretta, Thiago Alves de Queiroz:
A biased random key genetic algorithm for open dimension nesting problems using no-fit raster. Expert Syst. Appl. 81: 358-371 (2017) - 2016
- [j1]Luiz Henrique Cherri, Leandro Resende Mundim, Marina Andretta, Franklina Maria Bragion Toledo, José Fernando Oliveira, Maria Antónia Carravilla:
Robust mixed-integer linear programming models for the irregular strip packing problem. Eur. J. Oper. Res. 253(3): 570-583 (2016) - 2012
- [c1]Leandro Resende Mundim, Thiago Alves de Queiroz:
A hybrid heuristic for the 0-1 knapsack problem with items of irregular shape. CLEI 2012: 1-6
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-07-30 21:35 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:
