Uchoa Eduardo

Eduardo Uchoa

Information about the author Eduardo Uchoa will soon be added to the site.
Found 12 papers in total
New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
2017
The vehicle routing problem with time windows (VRPTW) consists of finding...
Column generation approaches for the software clustering problem
2016
This work presents the application of branch‐and‐price approaches to the...
Unsplittable non-additive capacitated network design using set functions polyhedra
2016
In this paper, we address the Unsplittable Non-Additive Capacitated Network Design...
A column generation approach for power‐aware optimization of virtualized heterogeneous server clusters
2012
Increasingly, clusters of servers have been deployed in large data centers to support...
A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem
2012
This paper deals with the Heterogeneous Fleet Vehicle Routing Problem (HFVRP). The...
Strong bounds with cut and column generation for class‐teacher timetabling
2012
This work presents an integer programming formulation for a variant of the...
Branch‐and‐cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
2011
We propose a branch‐and‐cut approach over a formulation with only the...
Optimizing Helicopter Transport of Oil Rig Crews at Petrobras
2010
Petrobras produces nearly 90 percent of Brazil's oil at about 80 offshore oil...
Solving capacitated arc routing problems using a transformation to the capacitated vehicle routing problem
2006
A well-known transformation by Pearn, Assad and Golden reduces a capacitated arc...
Reduction tests for the prize-collecting Steiner problem
2006
This article introduces a proper redifinition of the concept of bottleneck Steiner...
A hybrid GRASP with perturbations for the Steiner problem in graphs
2002
We propose and describe a hybrid GRASP with weight perturbations and adaptive...
The γ-connected assignment problem
1999
Given a graph and costs of assigning to each vertex one of k different colors, we want...
Papers per page: