Eduardo Uchoa
Orcid: 0000-0002-8687-2613
According to our database1,
Eduardo Uchoa
authored at least 81 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
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
2023
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
Comput. Oper. Res., 2023
2022
Proceedings of the XLVIII Latin American Computer Conference, 2022
2021
Transp. Sci., 2021
Oper. Res. Lett., 2021
Comput. Oper. Res., 2021
2020
The Multiple Steiner TSP with order constraints: complexity and optimization algorithms.
Soft Comput., 2020
J. Sched., 2020
Math. Program., 2020
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
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
INFORMS J. Comput., 2019
Improved state space relaxation for constrained two-dimensional guillotine cutting problems.
Eur. J. Oper. Res., 2019
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
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
Comput. Oper. Res., 2018
2017
Math. Program. Comput., 2017
New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows.
INFORMS J. Comput., 2017
Eur. J. Oper. Res., 2017
2016
Comput. Oper. Res., 2016
Comput. Optim. Appl., 2016
2014
Eur. J. Oper. Res., 2014
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
Math. Program. Comput., 2013
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
Expert Syst. Appl., 2012
Eur. J. Oper. Res., 2012
A column generation approach for power-aware optimization of virtualized heterogeneous server clusters.
Comput. Ind. Eng., 2012
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
Oper. Res. Lett., 2010
Oper. Res. Lett., 2010
Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems.
Math. Program. Comput., 2010
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
Proceedings of the ATMOS 2010, 2010
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
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
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
Math. Program., 2006
Comput. Oper. Res., 2006
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006
2005
Electron. Notes Discret. Math., 2005
2004
Proceedings of the Integer Programming and Combinatorial Optimization, 2004
2002
INFORMS J. Comput., 2002
Proceedings of the Algorithmic Methods and Models for Optimization of Railways, 2002
2001
Math. Program., 2001
Electron. Notes Discret. Math., 2001
1999