Leizer de Lima Pinto

Orcid: 0000-0001-8750-5228

Affiliations:
  • Federal University of Goiás, Brazil
  • Federal University of Rio de Janeiro, COPPE/UFRJ, Brazil


According to our database1, Leizer de Lima Pinto authored at least 14 papers between 2009 and 2023.

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

2023
PlaceRAN: Optimal Placement of Virtualized Network Functions in Beyond 5G Radio Access Networks.
IEEE Trans. Mob. Comput., September, 2023

2022
Optimal Joint Functional Split and Network Function Placement in Virtualized RAN With Splittable Flows.
IEEE Wirel. Commun. Lett., 2022

Bi-objective Optimization for Energy Efficiency and Centralization Level in Virtualized RAN.
Proceedings of the IEEE International Conference on Communications, 2022

Efficient allocation of disaggregated RAN functions and Multi-access Edge Computing services.
Proceedings of the IEEE Global Communications Conference, 2022

2021
Flow routing aiming load balancing and path length in multi-hop networks with different link qualities.
RAIRO Oper. Res., 2021

PlaceRAN: Optimal Placement for the Virtualized Next-Generation RAN.
CoRR, 2021

2019
An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing.
Comput. Oper. Res., 2019

2016
Improving load balancing, path length, and stability in low-cost wireless backhauls.
Ad Hoc Networks, 2016

2014
Load balancing routing for path length and overhead controlling in Wireless Mesh Networks.
Proceedings of the IEEE Symposium on Computers and Communications, 2014

2013
A Scheduling Strategy for Global Scientific Grids - Minimizing Simultaneously Time and Energy Consumption.
Proceedings of the ICEIS 2013, 2013

2012
Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization.
Comput. Oper. Res., 2012

2010
An efficient algorithm for the Steiner Tree Problem with revenue, bottleneck and hop objective functions.
Eur. J. Oper. Res., 2010

On algorithms for the tricriteria shortest path problem with two bottleneck objective functions.
Comput. Oper. Res., 2010

2009
The tricriterion shortest path problem with at least two bottleneck objective functions.
Eur. J. Oper. Res., 2009


  Loading...