Geraldo Robson Mateus

Orcid: 0000-0002-7238-0714

Affiliations:
  • Federal University of Minas Gerais, Belo Horizonte, Brasil


According to our database1, Geraldo Robson Mateus authored at least 123 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Vehicle Routing Problem with Cross-Docking and Scheduling at the Docking Station: Compact formulation and a General Variable Neighborhood Search metaheuristic.
Appl. Soft Comput., 2024

2023
cudaBRKGA-CNN: An Approach for Optimizing Convolutional Neural Network Architectures.
Proceedings of the IEEE Congress on Evolutionary Computation, 2023

2022
Branch-and-cut algorithms for the -arborescence star problem.
Int. Trans. Oper. Res., 2022

Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks.
Eur. J. Oper. Res., 2022

Multi-echelon Supply Chains with Uncertain Seasonal Demands and Lead Times Using Deep Reinforcement Learning.
CoRR, 2022

A hybrid heuristic for capacitated three-level lot-sizing and replenishment problems with a distribution structure.
Comput. Ind. Eng., 2022

A demand aware strategy for a machine learning approach to VNF-PC problem.
Proceedings of the 11th IEEE International Conference on Cloud Networking, 2022

A Mixed-Integer Programming Formulation and Heuristics for an Integrated Production Planning and Scheduling Problem.
Proceedings of the Metaheuristics - 14th International Conference, 2022

2021
On the analysis of online and periodic virtual network embedding in multi-domain environments.
Int. J. Netw. Virtual Organisations, 2021

Coupling Feasibility Pump and Large Neighborhood Search to solve the Steiner team orienteering problem.
Comput. Oper. Res., 2021

A hybrid optimization-Machine Learning approach for the VNF placement and chaining problem.
Comput. Networks, 2021

Uma Abordagem Heurística para o Posicionamento e Encadeamento de Funções Virtuais de Rede em Ambientes Online.
Proceedings of the 39th Brazilian Symposium on Computer Networks and Distributed Systems, 2021

Applying and Comparing Policy Gradient Methods to Multi-echelon Supply Chains with Uncertain Demands and Lead Times.
Proceedings of the Artificial Intelligence and Soft Computing, 2021

2020
Corrigendum to "A cutting-plane algorithm for the Steiner team orienteering problem" [Comput. Ind. Eng. 135 (2019) 922-939].
Comput. Ind. Eng., 2020

Alocação de Recursos para Redes Virtuais com Seleção de Método de Resolução via Aprendizado de Máquina.
Proceedings of the XXXVIII Brazilian Symposium on Computer Networks and Distributed Systems, 2020

Deep Reinforcement Learning and Optimization Approach for Multi-echelon Supply Chain with Uncertain Demands.
Proceedings of the Computational Logistics - 11th International Conference, 2020

2019
Managing virtual network embedding through reconfiguration and expansion.
Simul., 2019

Configuration-based approach for topological problems in the design of wireless sensor networks.
Int. Trans. Oper. Res., 2019

The <i>p</i>-arborescence star problem: Formulations and exact solution approaches.
Comput. Oper. Res., 2019

A cutting-plane algorithm for the Steiner team orienteering problem.
Comput. Ind. Eng., 2019

Abordagens Exata e Heurística para o Mapeamento de Redes Virtuais.
Proceedings of the Companion Proceedings of the 37th Brazilian Symposium on Computer Networks and Distributed Systems, 2019

Computational Performance ofCarsharing Fleet-Sizing Optimization.
Proceedings of the XX Brazilian Symposium on Geoinformatics, 2019

A Composition Selection Mechanism for Chaining and Placement of Virtual Network Functions.
Proceedings of the 15th International Conference on Network and Service Management, 2019

2018
Optimization Problems, Models, and Heuristics in Wireless Sensor Networks.
Proceedings of the Handbook of Heuristics., 2018

Compact and Extended Formulations for the Virtual Network Embedding Problem.
Electron. Notes Discret. Math., 2018

Abordagens Descentralizadas para o Mapeamento de Redes Virtuais em Ambientes Multidomínio.
Proceedings of the XXXVI Brazilian Symposium on Computer Networks and Distributed Systems, 2018

Virtual network embedding in multi-domain environments with energy efficiency concepts.
Proceedings of the 2018 International Conference on Information Networking, 2018

2017
Corrigendum to "Improved Combinatorial Benders Decomposition for a Scheduling Problem with Unrelated Parallel Machines".
J. Appl. Math., 2017

Improved Combinatorial Benders Decomposition for a Scheduling Problem with Unrelated Parallel Machines.
J. Appl. Math., 2017

A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports.
Eur. J. Oper. Res., 2017

Bi-objective data gathering path planning for vehicles with bounded curvature.
Comput. Oper. Res., 2017

2016
A hierarchical approach to solve a production planning and scheduling problem in bulk cargo terminal.
Comput. Ind. Eng., 2016

Time-Optimized Routing Problem for Vehicles with Bounded Curvature.
Proceedings of the XIII Latin American Robotics Symposium and IV Brazilian Robotics Symposium, 2016

Hybrid heuristics for the minimum tollbooth problem.
Proceedings of the 19th IEEE International Conference on Intelligent Transportation Systems, 2016

2015
A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem.
Transp. Sci., 2015

Auto-parametrização do GRASP com Path-Relinking no agrupamento de dados com F-Race e iterated F-Race [Automatic Tuning of GRASP with Path-Relinking in data clustering with F-Race and iterated F-Race].
Proceedings of the annual conference on Brazilian Symposium on Information Systems, 2015

2014
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices.
Optim. Lett., 2014

Iterated local search heuristics for the Vehicle Routing Problem with Cross-Docking.
Expert Syst. Appl., 2014

Branch-and-price algorithm for the Resilient Multi-level Hop-constrained Network Design.
Eur. J. Oper. Res., 2014

On a Vector Space Representation in Genetic Algorithms for Sensor Scheduling in Wireless Sensor Networks.
Evol. Comput., 2014

Topological Design of Resilient Heterogeneous Networks with QoS.
Proceedings of the 2014 Brazilian Symposium on Computer Networks and Distributed Systems, 2014

Heuristics for the design of heterogeneous telecommunication networks with QoS.
Proceedings of the IEEE Symposium on Computers and Communications, 2014

The Issues of Solving Staffing and Scheduling Problems in Software Development Projects.
Proceedings of the IEEE 38th Annual Computer Software and Applications Conference, 2014

2013
Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing Problem.
Optim. Lett., 2013

The Pickup and Delivery Problem with Cross-Docking.
Comput. Oper. Res., 2013

A column generation-based heuristic for the GRWA with protection and QoS in WDM optical networks.
Proceedings of the 2013 IEEE Symposium on Computers and Communications, 2013

Lifetime maximization of hop-and-delay constrained wireless sensor networks with mobile agent.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
Formulations for the RWA problem with traffic grooming, protection and QoS in WDM optical networks.
Proceedings of the 2012 IEEE Symposium on Computers and Communications, 2012

2011
GRASP with path-relinking for the generalized quadratic assignment problem.
J. Heuristics, 2011

A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking.
Electron. Notes Discret. Math., 2011

Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem.
Electron. Notes Discret. Math., 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

An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

GRASP with Path-Relinking for Data Clustering: A Case Study for Biological Data.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

A Novel Column Generation Algorithm for the Vehicle Routing Problem with Cross-Docking.
Proceedings of the Network Optimization - 5th International Conference, 2011

A Genetic Algorithm for Solving a Public Sector Sustainable Supply Chain Design Problem.
Proceedings of the ICEIS 2011, 2011

A Model for Designing Non Cooperative Supply Chain Where Logistics Service Providers Take Part.
Proceedings of the ICEIS 2011, 2011

Stochastic capacity planning in a Global Mining Supply Chain.
Proceedings of the 2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems, 2011

2010
Capacitated lot sizing and sequence dependent setup scheduling: an iterative approach for integration.
J. Sched., 2010

The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation.
Discret. Appl. Math., 2010

A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times.
Comput. Oper. Res., 2010

An Evolutionary Dynamic Approach for Designing Wireless Sensor Networks for Real Time Monitoring.
Proceedings of the DS-RT '10 Proceedings of the 2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications, 2010

Cosine function applied to the inertia control in the Particle Swarm Optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010

An evolutionary algorithm to the Density Control, Coverage and Routing Multi-Period Problem in Wireless Sensor Networks.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010

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

The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks.
Electron. Notes Discret. Math., 2009

A New Approach to the Software Release Planning.
Proceedings of the XXIII Brazilian Symposium on Software Engineering, 2009

Hybrid multiobjective approach for designing wireless sensor networks.
Proceedings of the 12th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2009

A GRASP heuristic to Density Control: Solving multi-period coverage and Routing Problems in Wireless Sensor Networks.
Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC 2009), 2009

General hybrid column generation algorithm for crew scheduling problems using genetic algorithm.
Proceedings of the IEEE Congress on Evolutionary Computation, 2009

A dynamic multiobjective hybrid approach for designing Wireless Sensor Networks.
Proceedings of the IEEE Congress on Evolutionary Computation, 2009

2008
Integer Programming Formulations for the k-Cardinality Tree Problem.
Electron. Notes Discret. Math., 2008

Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times.
Comput. Oper. Res., 2008

A vehicular waiting time heuristic for dynamic vehicle routing problem.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 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

A Hybrid Evolutionary Multi-Objective Algorithm to Setup Explicit Routes in MPLS Networks.
Proceedings of the 8th International Conference on Hybrid Intelligent Systems (HIS 2008), 2008

2007
Evolutionary Algorithms for Combinatorial Problems in the Uncertain Environment of the Wireless Sensor Networks.
Proceedings of the Evolutionary Computation in Dynamic and Uncertain Environments, 2007

Demand-driven server and service location in third generation mobile networks.
Wirel. Commun. Mob. Comput., 2007

A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows.
Comput. Oper. Res., 2007

Model and algorithms for the Multicommodity Traveling Salesman Problem.
Proceedings of the 7th International Conference on Hybrid Intelligent Systems, 2007

Hybrid approach to solve a crew scheduling problem: an exact column generation algorithm improved by metaheuristics.
Proceedings of the 7th International Conference on Hybrid Intelligent Systems, 2007

Crew scheduling urban problem: an exact column generation approach improved by a genetic algorithm.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007

2006
Optimization Issues in Distribution Network Design.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005
Wireless Communication and Mobile Computing.
Proceedings of the Handbook of Algorithms for Wireless Networking and Mobile Computing., 2005

Data dissemination in autonomic wireless sensor networks.
IEEE J. Sel. Areas Commun., 2005

Dynamic content distribution for mobile enterprise networks.
IEEE J. Sel. Areas Commun., 2005

A performance guarantee heuristic for electronic components placement problems including thermal effects.
Comput. Oper. Res., 2005

Data dissemination based on the energy map.
IEEE Commun. Mag., 2005

Data Dissemination Using the Energy Map.
Proceedings of the 2nd International Conference on Wireless on Demand Network Systems and Service (WONS 2005), 2005

An Optimal Node Scheduling for Flat Wireless Sensor Networks.
Proceedings of the Networking, 2005

Low-Cost Design Approach to WDM Mesh Networks.
Proceedings of the Networking, 2005

A Hybrid Approach for the Dynamic Vehicle Routing Problem with Time Windows.
Proceedings of the 5th International Conference on Hybrid Intelligent Systems (HIS 2005), 2005

Evolutionary algorithm for the dynamic coverage problem applied to wireless sensor networks design.
Proceedings of the IEEE Congress on Evolutionary Computation, 2005

2004
Dynamic Content Placement for Mobile Content Distribution Networks.
Proceedings of the Web Content Caching and Distribution: 9th International Workshop, 2004

Mobile dynamic content distribution networks.
Proceedings of the 7th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2004

A Two-Phase Genetic and Set Partitioning Approach for the Vehicle Routing Problem with Time Windows.
Proceedings of the 4th International Conference on Hybrid Intelligent Systems (HIS 2004), 2004

Hierarchical Tournament Selection Genetic Algorithm for the Vehicle Routing Problem with Time Windows.
Proceedings of the 4th International Conference on Hybrid Intelligent Systems (HIS 2004), 2004

2003
Lagrangean Based Methods for Solving Large-Scale Cellular Network Design Problems.
Wirel. Networks, 2003

A Location-Based Service Application for a Mobile Computing Environment.
Simul., 2003

Parallel algorithms for a multi-level network optimization problem.
Parallel Algorithms Appl., 2003

A Branch-and-Bound Algorithm to Solve a Multi-level Network Optimization Problem.
J. Math. Model. Algorithms, 2003

Performance Analysis for Data Service in Third Generation Mobile Telecommunication Networks.
J. Braz. Comput. Soc., 2003

A Lagrangian-based heuristic for traffic grooming in WDM optical networks.
Proceedings of the Global Telecommunications Conference, 2003

Simulating Demand-Driven Server and Service Location in Third Generation Mobile Networks.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

Location-Based Taxi Service in Wireless Communication Environment.
Proceedings of the Proceedings 36th Annual Simulation Symposium (ANSS-36 2003), Orlando, Florida, USA, March 30, 2003

2002
Simulation and Analysis of a New Mobility Model for Mobile Communication Networks.
Ann. Oper. Res., 2002

InterQoS - Strategy Enterprise Game for Price and QoS Negotiation on the Internet.
Proceedings of the From QoS Provisioning to QoS Charging, 2002

2001
Optimal Network Design for Wireless Local Area Network.
Ann. Oper. Res., 2001

The Server and Service Location Problem in the Third Generation Mobile Communication Systems: Modelling and Algorithms.
Proceedings of the Tagungsband der GI/OCG-Jahrestagung - 31. Jahrestagung der Gesellschaft für Informatik, Wirtschaft und Wissenschaft in der Network Economy, 2001

A mixed-integer programming model for the cellular telecommunication network design.
Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

2000
Model and heuristic for a generalized access network design problem.
Telecommun. Syst., 2000

Heuristics for Distribution Network Design in Telecommunication.
J. Heuristics, 2000

Server location in mobile computing.
Proceedings of the 2000 IEEE Wireless Communications and Networking Conference, 2000

On the design and capacity planning of a wireless local area network.
Proceedings of the Networked Planet: Management Beyond 2000, 2000

QoS and simulation models in mobile communication networks.
Proceedings of the 3rd International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2000

1999
Algorithms for a multi-level network optimization problem.
Eur. J. Oper. Res., 1999

Exact sequential choice of locations in a network.
Ann. Oper. Res., 1999

Traffic Simulation and the Location of Mobile Units in Wireless Communication Systems.
Proceedings of the 1st Latin American Network Operations and Management Symposium, 1999

Optimal base station placement and fixed channel assignment applied to wireless local area network projects.
Proceedings of the IEEE International Conference on Networks 1999, 1999

A superimposition algorithm for application-aware adaptation in mobile computing.
Proceedings of the 1999 IEEE International Conference on Communications: Global Convergence Through Communications, 1999

A comparison between location updates and location area paging for mobile unit tracking simulation in wireless communication systems.
Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 1999), 1999

1998
Solving to optimality the uncapacitated fixed-charge network flow problem.
Comput. Oper. Res., 1998


  Loading...