Cristiano Arbex Valle

Orcid: 0000-0001-5501-9719

According to our database1, Cristiano Arbex Valle authored at least 17 papers between 2008 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Ensemble pruning via an integer programming approach with diversity constraints.
Proceedings of the 11th International Network Optimization Conference, 2024

2022
Ensemble pruning via an integer programming approach with diversity constraints.
CoRR, 2022

2021
Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment.
Comput. Oper. Res., 2021

2020
Order batching using an approximation for the distance travelled by pickers.
Eur. J. Oper. Res., 2020

Dynamic Portfolio Optimization Using a Hybrid MLP-HAR Approach.
Proceedings of the 2020 IEEE Symposium Series on Computational Intelligence, 2020

Detecting and Predicting Evidences of Insider Trading in the Brazilian Market.
Proceedings of the Machine Learning and Knowledge Discovery in Databases. Applied Data Science and Demo Track, 2020

2018
Exact solution approaches for the Multi-period Degree Constrained Minimum Spanning Tree Problem.
Eur. J. Oper. Res., 2018

2017
Optimally solving the joint order batching and picker routing problem.
Eur. J. Oper. Res., 2017

Novel approaches for portfolio construction using second order stochastic dominance.
Comput. Manag. Sci., 2017

2016
Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
Factor neutral portfolios.
OR Spectr., 2015

An optimisation approach to constructing an exchange-traded fund.
Optim. Lett., 2015

2014
Market neutral portfolios.
Optim. Lett., 2014

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

Balancing message delivery latency and network lifetime through an integrated model for clustering and routing in Wireless Sensor Networks.
Comput. Networks, 2011

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

2008
Algorithms for improving the quality of service in wireless sensor networks with multiple mobile sinks.
Proceedings of the 11th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2008


  Loading...