( en | de | ru )

 

Disambiguation of "Mundim, Leandro Resende"

Author of the publication

copydeleteadd this publication to your clipboard
Improving Portfolio Optimization Using Weighted Link Prediction in Dynamic Stock Networks.

, , , and . ICCS (3), volume 11538 of Lecture Notes in Computer Science, page 340-353. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Leandro Maciel

Leandro Cravero

Leandro Perucchi

Leandro Velloso

Leandro Hofstätter

 

Other publications of authors with the same name

A separation and compaction algorithm for the two-open dimension nesting problem using penetration-fit raster and obstruction map., , , and . Expert Syst. Appl., (June 2023)Evaluation of Error Metrics for Meta-learning Label Definition in the Forecasting Task., , and . HAIS, volume 12344 of Lecture Notes in Computer Science, page 397-409. Springer, (2020)Multiobjective pseudo-variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time., and . ITOR, 27 (3): 1478-1500 (2020)Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem., and . Electron. Notes Discret. Math., (2018)A general heuristic for two-dimensional nesting problems with limited-size containers., , , and . Int. J. Prod. Res., 56 (1-2): 709-732 (2018)Improving Portfolio Optimization Using Weighted Link Prediction in Dynamic Stock Networks., , , and . ICCS (3), volume 11538 of Lecture Notes in Computer Science, page 340-353. Springer, (2019)A hybrid heuristic for the 0-1 knapsack problem with items of irregular shape., and . CLEI, page 1-6. IEEE, (2012)Multi-objective Basic Variable Neighborhood Search for Portfolio Selection., , and . ICVNS, volume 12010 of Lecture Notes in Computer Science, page 67-80. Springer, (2019)Genetic Algorithm for the Knapsack Problem with Irregular Shaped Items., , and . CLEI, page 192-199. IEEE, (2018)