Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeizer de Lima Pinto
Person information
- affiliation: Federal University of Goiás, Brazil
- affiliation: Federal University of Rio de Janeiro, COPPE/UFRJ, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j9]Fernando Zanferrari Morais
, Gabriel Matheus F. de Almeida, Leizer de Lima Pinto, Kleber Vieira Cardoso, Luis M. Contreras, Rodrigo da Rosa Righi, Cristiano Bonato Both:
PlaceRAN: Optimal Placement of Virtualized Network Functions in Beyond 5G Radio Access Networks. IEEE Trans. Mob. Comput. 22(9): 5434-5448 (2023)- 2022
- [j8]Gabriel Matheus de Almeida, Leizer de Lima Pinto, Cristiano Bonato Both, Kleber Vieira Cardoso:
Optimal Joint Functional Split and Network Function Placement in Virtualized RAN With Splittable Flows. IEEE Wirel. Commun. Lett. 11(8): 1684-1688 (2022) - 2021
- [j7]Leizer de Lima Pinto, Kátia Cilene Costa Fernandes, Kleber Vieira Cardoso:
Flow routing aiming load balancing and path length in multi-hop networks with different link qualities. RAIRO Oper. Res. 55(5): 2631-2637 (2021) - 2019
- [j6]Leizer de Lima Pinto, Kátia Cilene Costa Fernandes, Kleber Vieira Cardoso, Nelson Maculan:
An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing. Comput. Oper. Res. 106: 28-35 (2019) - 2016
- [j5]Micael O. M. C. de Mello, Vinicius C. M. Borges, Leizer de Lima Pinto, Kleber Vieira Cardoso:
Improving load balancing, path length, and stability in low-cost wireless backhauls. Ad Hoc Networks 48: 16-28 (2016) - 2012
- [j4]Claudio T. Bornstein, Nelson Maculan, Marta Pascoal, Leizer de Lima Pinto:
Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization. Comput. Oper. Res. 39(9): 1969-1976 (2012) - 2010
- [j3]Leizer de Lima Pinto, Marta M. B. Pascoal:
On algorithms for the tricriteria shortest path problem with two bottleneck objective functions. Comput. Oper. Res. 37(10): 1774-1779 (2010) - [j2]Leizer de Lima Pinto, Gilbert Laporte:
An efficient algorithm for the Steiner Tree Problem with revenue, bottleneck and hop objective functions. Eur. J. Oper. Res. 207(1): 45-49 (2010) - 2009
- [j1]Leizer de Lima Pinto, Claudio T. Bornstein, Nelson Maculan:
The tricriterion shortest path problem with at least two bottleneck objective functions. Eur. J. Oper. Res. 198(2): 387-391 (2009)
Conference and Workshop Papers
- 2022
- [c4]Luciano de S. Fraga, Gabriel Matheus de Almeida, Sand Correa, Cristiano Both, Leizer de Lima Pinto, Kleber Vieira Cardoso:
Efficient allocation of disaggregated RAN functions and Multi-access Edge Computing services. GLOBECOM 2022: 191-196 - [c3]William Pires, Gabriel Matheus de Almeida, Sand Correa, Cristiano Both, Leizer de Lima Pinto, Kleber Vieira Cardoso:
Bi-objective Optimization for Energy Efficiency and Centralization Level in Virtualized RAN. ICC 2022: 1034-1039 - 2014
- [c2]Micael O. M. C. de Mello, Vinicius C. M. Borges, Leizer de Lima Pinto, Kleber Vieira Cardoso:
Load balancing routing for path length and overhead controlling in Wireless Mesh Networks. ISCC 2014: 1-6 - 2013
- [c1]Fábio Coutinho, Leizer de Lima Pinto, Claudio T. Bornstein:
A Scheduling Strategy for Global Scientific Grids - Minimizing Simultaneously Time and Energy Consumption. ICEIS (1) 2013: 545-553
Informal and Other Publications
- 2021
- [i1]Fernando Zanferrari Morais, Gabriel Matheus de Almeida, Leizer de Lima Pinto, Kleber Vieira Cardoso, Luis M. Contreras, Rodrigo da Rosa Righi, Cristiano Bonato Both:
PlaceRAN: Optimal Placement for the Virtualized Next-Generation RAN. CoRR abs/2102.13192 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
