Fábio Luiz Usberti

Orcid: 0000-0002-8972-080X

Affiliations:
  • Campinas State University, Brazil


According to our database1, Fábio Luiz Usberti authored at least 30 papers between 2009 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
Lagrangian relaxation for maximum service in multicast routing with QoS constraints.
Int. Trans. Oper. Res., January, 2024

Exact algorithms and heuristics for capacitated covering salesman problems.
CoRR, 2024

2023
Switch Allocation Problem in Power Distribution Systems with Distributed Generation.
Oper. Res. Forum, September, 2023

Branch-and-cut algorithms for the covering salesman problem.
RAIRO Oper. Res., May, 2023

On the complexity and modeling of the electric vehicle sharing problem.
Comput. Ind. Eng., May, 2023

Interruption flows for reliability evaluation of power distribution networks.
Oper. Res., March, 2023

A parameterized lower bounding method for the open capacitated arc routing problem.
EURO J. Comput. Optim., January, 2023

A theoretical and computational study of green vehicle routing problems.
J. Comb. Optim., 2023

On the approximability and energy-flow modeling of the electric vehicle sharing problem.
CoRR, 2023

Exact approaches for the Minimum Subgraph Diameter Problem.
Comput. Oper. Res., 2023

2022
Triangle-Based Heuristics for Area Optimal Polygonizations.
ACM J. Exp. Algorithmics, 2022

The Capacitated and Economic Districting Problem.
INFORMS J. Comput., 2022

An Evolutionary Algorithm Applied to the Bi-Objective Travelling Salesman Problem.
Proceedings of the Metaheuristics - 14th International Conference, 2022

2021
Combinatorial Properties for the Green Vehicle Routing Problem.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2019
Evolutionary framework for two-stage stochastic resource allocation problems.
CoRR, 2019

An efficiency-based path-scanning heuristic for the capacitated arc routing problem.
Comput. Oper. Res., 2019

2018
Hybrid genetic algorithm for the open capacitated arc routing problem.
Comput. Oper. Res., 2018

Seasonal Streamflow Series Forecasting Using Recurrent Neural Networks.
Proceedings of the IEEE Latin American Conference on Computational Intelligence, 2018

2017
A 3-approximation algorithm for the maximum leaf <i>k</i>-forest problem.
Electron. Notes Discret. Math., 2017

Live Monitoring in Poultry Houses: A Broiler Detection Approach.
Proceedings of the 30th SIBGRAPI Conference on Graphics, Patterns and Images, 2017

2015
Flow-based formulation for the maximum leaf spanning tree problem.
Electron. Notes Discret. Math., 2015

Hierarchical multiple criteria optimization of maintenance activities on power distribution networks.
Ann. Oper. Res., 2015

2014
A redistricting problem applied to meter reading in power distribution networks.
Comput. Oper. Res., 2014

2013
GRASP with evolutionary path-relinking for the capacitated arc routing problem.
Comput. Oper. Res., 2013

2012
Heuristic and exact approaches for the open capacitated arc routing problem.
PhD thesis, 2012

A pseudo-polynomial algorithm for optimal capacitor placement on electric power distribution networks.
Eur. J. Oper. Res., 2012

A Knapsack Problem Approach for Optimal Allocation of Maintenance Resources on Electric Power Distribution Networks.
Proceedings of the ICORES 2012, 2012

2011
The open capacitated arc routing problem.
Comput. Oper. Res., 2011

2010
The open Capacitated Arc Routing Problem: Complexity and algorithms.
Proceedings of the 8th ACS/IEEE International Conference on Computer Systems and Applications, 2010

2009
Maintenance Resources Allocation on Power Distribution Networks with a Multi-Objective Framework.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009


  Loading...