Leonardo C. Martinez

According to our database1, Leonardo C. Martinez authored at least 8 papers between 2009 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Beating the Stock Market with a Deep Reinforcement Learning Day Trading System.
Proceedings of the 2020 International Joint Conference on Neural Networks, 2020

2014
The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm.
Discret. Appl. Math., 2014

2012
A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Heuristic and exact algorithms for a min-max selective vehicle routing problem.
Comput. Oper. Res., 2011

2010
Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm.
Electron. Notes Discret. Math., 2010

Adaptive Normalization: A novel data normalization approach for non-stationary time series.
Proceedings of the International Joint Conference on Neural Networks, 2010

2009
Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized.
Electron. Notes Discret. Math., 2009

From an artificial neural network to a stock market day-trading system: A case study on the BM&F BOVESPA.
Proceedings of the International Joint Conference on Neural Networks, 2009


  Loading...