Resende Mauricio G C

Mauricio G C Resende

Information about the author Mauricio G C Resende will soon be added to the site.
Found 12 papers in total
A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems
A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems
2017
A divisible load is an amount W of computational work that can be arbitrarily divided...
Heuristics for a hub location-routing problem
Heuristics for a hub location-routing problem
2016
We investigate a variant of the many‐to‐many hub location‐routing...
Hybridizations of GRASP with path relinking for the far from most string problem
Hybridizations of GRASP with path relinking for the far from most string problem
2016
Among the sequence selection and comparison problems, the far from most string problem...
A biased random-key genetic algorithm for the minimization of open stacks problem
A biased random-key genetic algorithm for the minimization of open stacks problem
2016
This paper describes a biased random‐key genetic algorithm (BRKGA) for the...
A biased random-key genetic algorithm for single-round divisible load scheduling
A biased random-key genetic algorithm for single-round divisible load scheduling
2015
A divisible load is an amount W of computational work that can be arbitrarily divided...
An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling
An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling
2014
This paper presents a local search, based on a new neighborhood for the...
Multi‐start methods for combinatorial optimization
Multi‐start methods for combinatorial optimization
2013
Multi‐start methods strategically sample the solution space of an optimization...
A parallel multi‐population biased random‐key genetic algorithm for a container loading problem
A parallel multi‐population biased random‐key genetic algorithm for a container loading problem
2012
This paper presents a multi‐population biased random‐key genetic...
Correspondence of projected 3-D points and lines using a continuous GRASP
Correspondence of projected 3-D points and lines using a continuous GRASP
2011
The field of computer vision has experienced rapid growth over the past 50 years. Many...
A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
2011
Interior gateway routing protocols like Open Shortest Path First (OSPF) and...
A biased random-key genetic algorithm for road congestion minimization
A biased random-key genetic algorithm for road congestion minimization
2010
One of the main goals in transportation planning is to achieve solutions for two...
Speeding Up Dynamic Shortest-Path Algorithms
Speeding Up Dynamic Shortest-Path Algorithms
2008
Dynamic shortest–path algorithms update the shortest paths taking into account a...
Papers per page: