Eduardo Uchoa

Orcid: 0000-0002-8687-2613

According to our database1, Eduardo Uchoa authored at least 83 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery.
Comput. Oper. Res., February, 2024

Special Section on "DIMACS Implementation Challenge: Vehicle Routing" and "The EURO Meets NeurIPS 2022 Vehicle Routing Competition".
Transp. Sci., 2024

VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem.
INFORMS J. Comput., 2024

Branch-cut-and-price algorithms for two routing problems with hotel selection.
Comput. Ind. Eng., 2024

2023
Solving vehicle routing problems with intermediate stops using VRPSolver models.
Networks, April, 2023

A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem.
4OR, March, 2023

Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems.
Oper. Res., 2023

A unified exact approach for Clustered and Generalized Vehicle Routing Problems.
Comput. Oper. Res., 2023

2022
Solving real urban VRPTW instances by applying a Branch-Cut-and-Price via VRPsolver.
Proceedings of the XLVIII Latin American Computer Conference, 2022

2021
A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing.
Transp. Sci., 2021

Cover by disjoint cliques cuts for the knapsack problem with conflicting items.
Oper. Res. Lett., 2021

Solving Bin Packing Problems Using VRPSolver Models.
Oper. Res. Forum, 2021

A POPMUSIC matheuristic for the capacitated vehicle routing problem.
Comput. Oper. Res., 2021

2020
The Multiple Steiner TSP with order constraints: complexity and optimization algorithms.
Soft Comput., 2020

On the exact solution of a large class of parallel machine scheduling problems.
J. Sched., 2020

A generic exact solver for vehicle routing and related problems.
Math. Program., 2020

On the exact solution of vehicle routing problems with backhauls.
Eur. J. Oper. Res., 2020

Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut.
Discret. Optim., 2020

A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection.
Comput. Oper. Res., 2020

On the Multiple Steiner Traveling Salesman Problem with Order Constraints.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019
Comparative Analysis of Capacitated Arc Routing Formulations for Designing a New Branch-Cut-and-Price Algorithm.
Transp. Sci., 2019

Distance Transformation for Network Design Problems.
SIAM J. Optim., 2019

Primal Heuristics for Branch and Price: The Assets of Diving Methods.
INFORMS J. Comput., 2019

Improved state space relaxation for constrained two-dimensional guillotine cutting problems.
Eur. J. Oper. Res., 2019

A layered compact formulation for the Multiple Steiner TSP with Order constraints.
Proceedings of the 6th International Conference on Control, 2019

2018
On the complete set packing and set partitioning polytopes: Properties and rank 1 facets.
Oper. Res. Lett., 2018

A robust and scalable algorithm for the Steiner problem in graphs.
Math. Program. Comput., 2018

Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation.
INFORMS J. Comput., 2018

Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems.
Eur. J. Oper. Res., 2018

A branch-and-price algorithm for the Minimum Latency Problem.
Comput. Oper. Res., 2018

2017
Limited memory Rank-1 Cuts for Vehicle Routing Problems.
Oper. Res. Lett., 2017

Improved branch-cut-and-price for capacitated vehicle routing.
Math. Program. Comput., 2017

New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows.
INFORMS J. Comput., 2017

New benchmark instances for the Capacitated Vehicle Routing Problem.
Eur. J. Oper. Res., 2017

2016
Unsplittable non-additive capacitated network design using set functions polyhedra.
Comput. Oper. Res., 2016

Column generation approaches for the software clustering problem.
Comput. Optim. Appl., 2016

2014
Preface.
RAIRO Oper. Res., 2014

Exact algorithms for the traveling salesman problem with draft limits.
Eur. J. Oper. Res., 2014

Formulations for a problem of petroleum transportation.
Eur. J. Oper. Res., 2014

New Exact Algorithms for the Capacitated Vehicle Routing Problem.
Proceedings of the Vehicle Routing, 2014

2013
Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery.
Optim. Lett., 2013

Hop-level flow formulation for the survivable network design with hop constraints problem.
Networks, 2013

The time dependent traveling salesman problem: polyhedra and algorithm.
Math. Program. Comput., 2013

Capacitated Network Design using Bin-Packing.
Electron. Notes Discret. Math., 2013

A hybrid algorithm for a class of vehicle routing problems.
Comput. Oper. Res., 2013

In-Out Separation and Column Generation Stabilization by Dual Price Smoothing.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

A hybrid genetic algorithm with local search approach for E/T scheduling problems on identical parallel machines.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

2012
Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem.
Networks, 2012

Fast local search for the steiner problem in graphs.
ACM J. Exp. Algorithmics, 2012

A GRASP-based approach to the generalized minimum spanning tree problem.
Expert Syst. Appl., 2012

A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem.
Eur. J. Oper. Res., 2012

A column generation approach for power-aware optimization of virtualized heterogeneous server clusters.
Comput. Ind. Eng., 2012

Strong bounds with cut and column generation for class-teacher timetabling.
Ann. Oper. Res., 2012

2011
Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery.
Oper. Res. Lett., 2011

Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs.
Math. Program., 2011

Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem.
Oper. Res. Lett., 2010

Improved lower bounds for the Split Delivery Vehicle Routing Problem.
Oper. Res. Lett., 2010

Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems.
Math. Program. Comput., 2010

Optimizing Helicopter Transport of Oil Rig Crews at Petrobras.
Interfaces, 2010

Solving Replica Placement and Request Distribution in Content Distribution Networks.
Electron. Notes Discret. Math., 2010

New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

The Team Orienteering Problem: Formulations and Branch-Cut and Price.
Proceedings of the ATMOS 2010, 2010

Fast Local Search for Steiner Trees in Graphs.
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

2009
A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem.
Networks, 2009

A distributed dual ascent algorithm for Steiner problems in multicast routing.
Networks, 2009

A facility location and installation of resources model for level of repair analysis.
Eur. J. Oper. Res., 2009

2008
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation.
Math. Program., 2008

2007
A Distributed Primal-Dual Heuristic for Steiner Problems in Networks.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

2006
A grid-enabled distributed branch-and-bound algorithm with application on the Steiner Problem in graphs.
Parallel Comput., 2006

Reduction tests for the prize-collecting Steiner problem.
Oper. Res. Lett., 2006

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.
Math. Program., 2006

Solving capacitated arc routing problems using a transformation to the CVRP.
Comput. Oper. Res., 2006

Column Generation Based Heuristic for a Helicopter Routing Problem.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

2005
Stabilized branch-and-cut-and-price for the generalized assignment problem.
Electron. Notes Discret. Math., 2005

2004
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2002
Preprocessing Steiner problems from VLSI layout.
Networks, 2002

A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs.
INFORMS J. Comput., 2002

Solving the Freight Car Flow Problem to Optimality.
Proceedings of the Algorithmic Methods and Models for Optimization of Railways, 2002

2001
Vertex-Disjoint Packing of Two Steiner Trees: polyhedra and branch-and-cut.
Math. Program., 2001

Dual Heuristics on the Exact Solution of Large Steiner Problems.
Electron. Notes Discret. Math., 2001

1999
The gamma-connected assignment problem.
Eur. J. Oper. Res., 1999


  Loading...