Leandro Resende Mundim

Orcid: 0000-0001-7122-4755

According to our database1, Leandro Resende Mundim authored at least 11 papers between 2012 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A separation and compaction algorithm for the two-open dimension nesting problem using penetration-fit raster and obstruction map.
Expert Syst. Appl., June, 2023

2020
Multiobjective pseudo-variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time.
Int. Trans. Oper. Res., 2020

Evaluation of Error Metrics for Meta-learning Label Definition in the Forecasting Task.
Proceedings of the Hybrid Artificial Intelligent Systems - 15th International Conference, 2020

2019
Multi-objective Basic Variable Neighborhood Search for Portfolio Selection.
Proceedings of the Variable Neighborhood Search - 7th International Conference, 2019

Improving Portfolio Optimization Using Weighted Link Prediction in Dynamic Stock Networks.
Proceedings of the Computational Science - ICCS 2019, 2019

2018
A general heuristic for two-dimensional nesting problems with limited-size containers.
Int. J. Prod. Res., 2018

Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem.
Electron. Notes Discret. Math., 2018

Genetic Algorithm for the Knapsack Problem with Irregular Shaped Items.
Proceedings of the XLIV Latin American Computer Conference, 2018

2017
A biased random key genetic algorithm for open dimension nesting problems using no-fit raster.
Expert Syst. Appl., 2017

2016
Robust mixed-integer linear programming models for the irregular strip packing problem.
Eur. J. Oper. Res., 2016

2012
A hybrid heuristic for the 0-1 knapsack problem with items of irregular shape.
Proceedings of the 2012 XXXVIII Conferencia Latinoamericana En Informatica (CLEI), 2012


  Loading...