default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFábio Luiz Usberti
Person information
- affiliation: Campinas State University, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Mateus Martin
, Fábio Luiz Usberti, Christiano Lyra:
Improving reliability with optimal allocation of maintenance resources: an application to power distribution networks. Ann. Oper. Res. 340(1): 345-365 (2024)- [j20]Welverton R. Silva, Fábio Luiz Usberti, Rafael C. S. Schouery:
On the approximability and energy-flow modeling of the electric vehicle sharing problem. Comput. Ind. Eng. 192: 110181 (2024) - [j19]Carlos Victor Dantas Araújo, Cid Carvalho de Souza, Fábio Luiz Usberti:
Lagrangian relaxation for maximum service in multicast routing with QoS constraints. Int. Trans. Oper. Res. 31(1): 140-166 (2024) - [i6]Lucas Porto Maziero, Fábio Luiz Usberti, Celso Cavellucci:
Exact algorithms and heuristics for capacitated covering salesman problems. CoRR abs/2403.06995 (2024) - 2023
- [j18]Welverton R. Silva, Fábio Luiz Usberti, Rafael C. S. Schouery:
On the complexity and modeling of the electric vehicle sharing problem. Comput. Ind. Eng. 179: 109208 (2023) - [j17]Arthur Pratti Dadalto, Fábio Luiz Usberti, Mário César San Felice:
Exact approaches for the Minimum Subgraph Diameter Problem. Comput. Oper. Res. 150: 106050 (2023) - [j16]Rafael Kendy Arakaki, Fábio Luiz Usberti:
A parameterized lower bounding method for the open capacitated arc routing problem. EURO J. Comput. Optim. 11: 100080 (2023) - [j15]Matheus Diógenes Andrade, Fábio Luiz Usberti:
A theoretical and computational study of green vehicle routing problems. J. Comb. Optim. 45(5): 118 (2023) - [j14]Fábio Luiz Usberti, Celso Cavellucci, Christiano Lyra:
Interruption flows for reliability evaluation of power distribution networks. Oper. Res. 23(1): 4 (2023) - [j13]Gustavo Pacheco Epifanio, José Federico Vizcaino González, Fábio Luiz Usberti, Luís Tarrataca, Laura Silva de Assis:
Switch Allocation Problem in Power Distribution Systems with Distributed Generation. Oper. Res. Forum 4(3): 58 (2023) - [j12]Lucas Porto Maziero, Fábio Luiz Usberti, Celso Cavellucci:
Branch-and-cut algorithms for the covering salesman problem. RAIRO Oper. Res. 57(3): 1149-1166 (2023) - [i5]Welverton R. Silva, Fábio Luiz Usberti, Rafael C. S. Schouery:
On the approximability and energy-flow modeling of the electric vehicle sharing problem. CoRR abs/2305.12176 (2023) - 2022
- [j11]Luis Henrique Pauleti Mendes, Fábio Luiz Usberti, Celso Cavellucci:
The Capacitated and Economic Districting Problem. INFORMS J. Comput. 34(4): 2003-2016 (2022) - [j10]Natanael Ramos, Raí C. de Jesus, Pedro J. de Rezende, Cid C. de Souza, Fábio Luiz Usberti:
Triangle-Based Heuristics for Area Optimal Polygonizations. ACM J. Exp. Algorithmics 27: 2.1:1-2.1:25 (2022) - [c8]Luis Henrique Pauleti Mendes, Fábio Luiz Usberti, Mário César San Felice:
An Evolutionary Algorithm Applied to the Bi-Objective Travelling Salesman Problem. MIC 2022: 519-524 - [i4]Welverton R. Silva, Fábio Luiz Usberti, Rafael C. S. Schouery:
On the complexity and modeling of the electric vehicle sharing problem. CoRR abs/2202.12918 (2022) - 2021
- [c7]Matheus Diógenes Andrade, Fábio Luiz Usberti:
Combinatorial Properties for the Green Vehicle Routing Problem. LAGOS 2021: 478-488 - [i3]Lucas Porto Maziero, Fábio Luiz Usberti, Celso Cavellucci:
Branch-and-cut algorithms for the covering salesman problem. CoRR abs/2104.01173 (2021) - [i2]Fábio Luiz Usberti, Celso Cavellucci, Christiano Lyra:
Interruption flows for reliability evaluation of power distribution networks. CoRR abs/2108.00058 (2021)
2010 – 2019
- 2019
- [j9]Rafael Kendy Arakaki, Fábio Luiz Usberti:
An efficiency-based path-scanning heuristic for the capacitated arc routing problem. Comput. Oper. Res. 103: 288-295 (2019) - [i1]Pedro Henrique Del Bianco Hokama, Mário César San Felice, Evandro C. Bracht, Fábio Luiz Usberti:
Evolutionary framework for two-stage stochastic resource allocation problems. CoRR abs/1903.01885 (2019) - 2018
- [j8]Rafael Kendy Arakaki, Fábio Luiz Usberti:
Hybrid genetic algorithm for the open capacitated arc routing problem. Comput. Oper. Res. 90: 221-231 (2018) - [c6]Jonatas Trabuco Belotti, Lilian N. A. Lazzarin, Fábio Luiz Usberti, Hugo Siqueira:
Seasonal Streamflow Series Forecasting Using Recurrent Neural Networks. LA-CCI 2018: 1-6 - 2017
- [j7]Marcio Felix Reis, Mário César San Felice, Orlando Lee, Fábio Luiz Usberti:
A 3-approximation algorithm for the maximum leaf k-forest problem. Electron. Notes Discret. Math. 62: 201-206 (2017) - [c5]Renan Vilas Novas, Fábio Luiz Usberti:
Live Monitoring in Poultry Houses: A Broiler Detection Approach. SIBGRAPI 2017: 216-222 - 2015
- [j6]Fábio Luiz Usberti, Christiano Lyra, Celso Cavellucci, José Federico Vizcaino González:
Hierarchical multiple criteria optimization of maintenance activities on power distribution networks. Ann. Oper. Res. 224(1): 171-192 (2015) - [j5]Marcio Felix Reis, Orlando Lee, Fábio Luiz Usberti:
Flow-based formulation for the maximum leaf spanning tree problem. Electron. Notes Discret. Math. 50: 205-210 (2015) - 2014
- [j4]Laura Silva de Assis, Paulo Morelato França, Fábio Luiz Usberti:
A redistricting problem applied to meter reading in power distribution networks. Comput. Oper. Res. 41: 65-75 (2014) - 2013
- [j3]Fábio Luiz Usberti, Paulo Morelato França, André Luiz Morelato França:
GRASP with evolutionary path-relinking for the capacitated arc routing problem. Comput. Oper. Res. 40(12): 3206-3217 (2013) - 2012
- [b1]Fábio Luiz Usberti:
Heuristic and exact approaches for the open capacitated arc routing problem. University of Campinas, Brazil, 2012 - [j2]José Federico Vizcaino González, Christiano Lyra, Fábio Luiz Usberti:
A pseudo-polynomial algorithm for optimal capacitor placement on electric power distribution networks. Eur. J. Oper. Res. 222(1): 149-156 (2012) - [c4]Eduardo Tadeu Bacalhau, Fábio Luiz Usberti, Christiano Lyra Filho, Celso Cavellucci:
A Knapsack Problem Approach for Optimal Allocation of Maintenance Resources on Electric Power Distribution Networks. ICORES 2012: 462-466 - 2011
- [j1]Fábio Luiz Usberti, Paulo Morelato França, André Luiz Morelato França:
The open capacitated arc routing problem. Comput. Oper. Res. 38(11): 1543-1555 (2011) - 2010
- [c3]Paulo Morelato França, Fábio Luiz Usberti, André Luiz Morelato França:
The open Capacitated Arc Routing Problem: Complexity and algorithms. AICCSA 2010: 1
2000 – 2009
- 2009
- [c2]Fábio Luiz Usberti, Paulo Morelato França, André Luiz Morelato França:
The Open Capacitated Arc Routing Problem. CTW 2009: 89-92 - [c1]Fábio Luiz Usberti, José Federico Vizcaino González, Christiano Lyra Filho, Celso Cavellucci:
Maintenance Resources Allocation on Power Distribution Networks with a Multi-Objective Framework. CTW 2009: 317-320
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-09-22 00:39 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:
