The gamma-connected assignment problem. - Marcus Poggi de Aragão; Eduardo Uchoa (Eur. J. Oper. Res., 1999)

Dual Heuristics on the Exact Solution of Large Steiner Problems. - Marcus Poggi de Aragão; Eduardo Uchoa; Renato Fonseca F. Werneck (Electron. Notes Discret. Math., 2001)

Vertex-Disjoint Packing of Two Steiner Trees: polyhedra and branch-and-cut. - Eduardo Uchoa; Marcus Poggi de Aragão (Math. Program., 2001)

Solving the Freight Car Flow Problem to Optimality. - Ricardo Fukasawa; Marcus Poggi de Aragão; Oscar Porto; Eduardo Uchoa (ATMOS, 2002)

A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs. - Celso C. Ribeiro; Eduardo Uchoa; Renato Fonseca F. Werneck (INFORMS J. Comput., 2002)

Preprocessing Steiner problems from VLSI layout. - Eduardo Uchoa; Marcus Poggi de Aragão; Celso C. Ribeiro (Networks, 2002)

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. - Ricardo Fukasawa; Jens Lysgaard; Marcus Poggi de Aragão; Marcelo L. Reis; Eduardo Uchoa; Renato Fonseca F. Werneck (IPCO, 2004)

Stabilized branch-and-cut-and-price for the generalized assignment problem. - Alexandre Pigatti; Marcus Poggi de Aragão; Eduardo Uchoa (Electron. Notes Discret. Math., 2005)

Column Generation Based Heuristic for a Helicopter Routing Problem. - Lorenza Moreno; Marcus Poggi de Aragão; Eduardo Uchoa (WEA, 2006)

Solving capacitated arc routing problems using a transformation to the CVRP. - Humberto J. Longo; Marcus Poggi de Aragão; Eduardo Uchoa (Comput. Oper. Res., 2006)

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. - Ricardo Fukasawa; Humberto J. Longo; Jens Lysgaard; Marcus Poggi de Aragão; Marcelo L. Reis; Eduardo Uchoa; Renato Fonseca F. Werneck (Math. Program., 2006)

Reduction tests for the prize-collecting Steiner problem. - Eduardo Uchoa (Oper. Res. Lett., 2006)

A grid-enabled distributed branch-and-bound algorithm with application on the Steiner Problem in graphs. - Lúcia M. A. Drummond; Eduardo Uchoa; Alexandre D. Gonçalves; Juliana M. N. Silva; Marcelo C. P. Santos; Maria Clicia Stelling de Castro (Parallel Comput., 2006)

A Distributed Primal-Dual Heuristic for Steiner Problems in Networks. - Marcelo C. P. Santos; Lúcia M. A. Drummond; Eduardo Uchoa (WEA, 2007)

Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation. - Eduardo Uchoa; Ricardo Fukasawa; Jens Lysgaard; Artur Alves Pessoa; Marcus Poggi de Aragão; Diogo Andrade (Math. Program., 2008)

A facility location and installation of resources model for level of repair analysis. - Eduardo Siqueira Brick; Eduardo Uchoa (Eur. J. Oper. Res., 2009)

A distributed dual ascent algorithm for Steiner problems in multicast routing. - Lúcia M. A. Drummond; Marcelo C. P. Santos; Eduardo Uchoa (Networks, 2009)

A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. - Artur Alves Pessoa; Eduardo Uchoa; Marcus Poggi de Aragão (Networks, 2009)

Fast Local Search for Steiner Trees in Graphs. - Eduardo Uchoa; Renato Fonseca F. Werneck (ALENEX, 2010)

The Team Orienteering Problem: Formulations and Branch-Cut and Price. - Marcus Poggi de Aragão; Henrique Viana; Eduardo Uchoa (ATMOS, 2010)

The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm. - Hernán G. Abeledo; Ricardo Fukasawa; Artur Alves Pessoa; Eduardo Uchoa (SEA, 2010)

New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery. - Anand Subramanian 001; Eduardo Uchoa; Luiz Satoru Ochi (SEA, 2010)

Solving Replica Placement and Request Distribution in Content Distribution Networks. - Tiago Araújo Neves; Lúcia M. A. Drummond; Luiz Satoru Ochi; Célio Albuquerque 001; Eduardo Uchoa (Electron. Notes Discret. Math., 2010)

Optimizing Helicopter Transport of Oil Rig Crews at Petrobras. - Fernanda Menezes; Oscar Porto; Marcelo L. Reis; Lorenza Moreno; Marcus Poggi de Aragão; Eduardo Uchoa; Hernán G. Abeledo; Nelci Carvalho do Nascimento (Interfaces, 2010)

Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems. - Artur Alves Pessoa; Eduardo Uchoa; Marcus Poggi de Aragão; Rosiane de Freitas Rodrigues (Math. Program. Comput., 2010)

Improved lower bounds for the Split Delivery Vehicle Routing Problem. - Lorenza Moreno; Marcus Poggi de Aragão; Eduardo Uchoa (Oper. Res. Lett., 2010)

A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem. - Marcelo C. P. Santos; Lúcia M. A. Drummond; Eduardo Uchoa (Oper. Res. Lett., 2010)

Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem. - Ali Ridha Mahjoub; Luidi Simonetti; Eduardo Uchoa (INOC, 2011)

Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. - Luis Eduardo Neves Gouveia; Luidi Simonetti; Eduardo Uchoa (Math. Program., 2011)

Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery. - Anand Subramanian 001; Eduardo Uchoa; Artur Alves Pessoa; Luiz Satoru Ochi (Oper. Res. Lett., 2011)

Strong bounds with cut and column generation for class-teacher timetabling. - Haroldo G. Santos; Eduardo Uchoa; Luiz Satoru Ochi; Nelson Maculan (Ann. Oper. Res., 2012)

A column generation approach for power-aware optimization of virtualized heterogeneous server clusters. - Hugo Harry Kramer; Vinicius Petrucci; Anand Subramanian 001; Eduardo Uchoa (Comput. Ind. Eng., 2012)

A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem. - Anand Subramanian 001; Puca Huachi Vaz Penna; Eduardo Uchoa; Luiz Satoru Ochi (Eur. J. Oper. Res., 2012)

A GRASP-based approach to the generalized minimum spanning tree problem. - Cristiane Ferreira; Luiz Satoru Ochi; Víctor Parada; Eduardo Uchoa (Expert Syst. Appl., 2012)

Fast local search for the steiner problem in graphs. - Eduardo Uchoa; Renato Fonseca F. Werneck (ACM J. Exp. Algorithmics, 2012)

Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem. - Eduardo Uchoa; Túlio A. M. Toffolo; Maurício C. de Souza; Alexandre Xavier Martins; Ricardo Fukasawa (Networks, 2012)

A hybrid genetic algorithm with local search approach for E/T scheduling problems on identical parallel machines. - Rainer Amorim; Bruno Dias; Rosiane de Freitas Rodrigues; Eduardo Uchoa (GECCO (Companion), 2013)

In-Out Separation and Column Generation Stabilization by Dual Price Smoothing. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa; François Vanderbeck (SEA, 2013)

A hybrid algorithm for a class of vehicle routing problems. - Anand Subramanian 001; Eduardo Uchoa; Luiz Satoru Ochi (Comput. Oper. Res., 2013)

Capacitated Network Design using Bin-Packing. - Amal Benhamiche; Ali Ridha Mahjoub; Nancy Perrot; Eduardo Uchoa (Electron. Notes Discret. Math., 2013)

The time dependent traveling salesman problem: polyhedra and algorithm. - Hernán G. Abeledo; Ricardo Fukasawa; Artur Alves Pessoa; Eduardo Uchoa (Math. Program. Comput., 2013)

Hop-level flow formulation for the survivable network design with hop constraints problem. - Ali Ridha Mahjoub; Luidi Simonetti; Eduardo Uchoa (Networks, 2013)

Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery. - Anand Subramanian 001; Eduardo Uchoa; Artur Alves Pessoa; Luiz Satoru Ochi (Optim. Lett., 2013)

New Exact Algorithms for the Capacitated Vehicle Routing Problem. - Marcus Poggi; Eduardo Uchoa (Vehicle Routing, 2014)

Formulations for a problem of petroleum transportation. - Luiz Aizemberg; Hugo Harry Kramer; Artur Alves Pessoa; Eduardo Uchoa (Eur. J. Oper. Res., 2014)

Exact algorithms for the traveling salesman problem with draft limits. - Maria Battarra; Artur Alves Pessoa; Anand Subramanian 001; Eduardo Uchoa (Eur. J. Oper. Res., 2014)

Preface. - Nelson Maculan; Ali Ridha Mahjoub; Eduardo Uchoa (RAIRO Oper. Res., 2014)

Column generation approaches for the software clustering problem. - Hugo Harry Kramer; Eduardo Uchoa; Marcia Fampa; Viviane Köhler; François Vanderbeck (Comput. Optim. Appl., 2016)

Unsplittable non-additive capacitated network design using set functions polyhedra. - Amal Benhamiche; Ali Ridha Mahjoub; Nancy Perrot; Eduardo Uchoa (Comput. Oper. Res., 2016)

New benchmark instances for the Capacitated Vehicle Routing Problem. - Eduardo Uchoa; Diego Pecin; Artur Alves Pessoa; Marcus Poggi; Thibaut Vidal; Anand Subramanian 001 (Eur. J. Oper. Res., 2017)

New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows. - Diego Pecin; Claudio Contardo; Guy Desaulniers; Eduardo Uchoa (INFORMS J. Comput., 2017)

Improved branch-cut-and-price for capacitated vehicle routing. - Diego Pecin; Artur Alves Pessoa; Marcus Poggi; Eduardo Uchoa (Math. Program. Comput., 2017)

Limited memory Rank-1 Cuts for Vehicle Routing Problems. - Diego Pecin; Artur Alves Pessoa; Marcus Poggi; Eduardo Uchoa; Haroldo G. Santos (Oper. Res. Lett., 2017)

A branch-and-price algorithm for the Minimum Latency Problem. - Teobaldo Bulhões; Ruslan Sadykov; Eduardo Uchoa (Comput. Oper. Res., 2018)

Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa (Eur. J. Oper. Res., 2018)

Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa; François Vanderbeck (INFORMS J. Comput., 2018)

A robust and scalable algorithm for the Steiner problem in graphs. - Thomas Pajor; Eduardo Uchoa; Renato F. Werneck (Math. Program. Comput., 2018)

On the complete set packing and set partitioning polytopes: Properties and rank 1 facets. - Teobaldo Bulhões; Artur Alves Pessoa; Fábio Protti; Eduardo Uchoa (Oper. Res. Lett., 2018)

A layered compact formulation for the Multiple Steiner TSP with Order constraints. - Ali Ridha Mahjoub; Raouia Taktak; Eduardo Uchoa (CoDIT, 2019)

Improved state space relaxation for constrained two-dimensional guillotine cutting problems. - André Soares Velasco; Eduardo Uchoa (Eur. J. Oper. Res., 2019)

Primal Heuristics for Branch and Price: The Assets of Diving Methods. - Ruslan Sadykov; François Vanderbeck; Artur Alves Pessoa; Issam Tahiri; Eduardo Uchoa (INFORMS J. Comput., 2019)

Distance Transformation for Network Design Problems. - Ali Ridha Mahjoub; Michael Poss; Luidi Simonetti; Eduardo Uchoa (SIAM J. Optim., 2019)

Comparative Analysis of Capacitated Arc Routing Formulations for Designing a New Branch-Cut-and-Price Algorithm. - Diego Pecin; Eduardo Uchoa (Transp. Sci., 2019)

On the Multiple Steiner Traveling Salesman Problem with Order Constraints. - Raouia Taktak; Eduardo Uchoa (ISCO, 2020)

A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection. - Luiz Henrique Barbosa; Eduardo Uchoa (Comput. Oper. Res., 2020)

Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut. - Amal Benhamiche; Ali Ridha Mahjoub; Nancy Perrot; Eduardo Uchoa (Discret. Optim., 2020)

On the exact solution of vehicle routing problems with backhauls. - Eduardo Queiroga; Yuri Frota; Ruslan Sadykov; Anand Subramanian 001; Eduardo Uchoa; Thibaut Vidal (Eur. J. Oper. Res., 2020)

A generic exact solver for vehicle routing and related problems. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa; François Vanderbeck (Math. Program., 2020)

On the exact solution of a large class of parallel machine scheduling problems. - Teobaldo Bulhões; Ruslan Sadykov; Anand Subramanian 001; Eduardo Uchoa (J. Sched., 2020)

The Multiple Steiner TSP with order constraints: complexity and optimization algorithms. - Virginie Gabrel; Ali Ridha Mahjoub; Raouia Taktak; Eduardo Uchoa (Soft Comput., 2020)

A POPMUSIC matheuristic for the capacitated vehicle routing problem. - Eduardo Queiroga; Ruslan Sadykov; Eduardo Uchoa (Comput. Oper. Res., 2021)

Solving Bin Packing Problems Using VRPSolver Models. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa (Oper. Res. Forum, 2021)

Cover by disjoint cliques cuts for the knapsack problem with conflicting items. - Thiago Alcântara Luiz; Haroldo Gambini Santos; Eduardo Uchoa (Oper. Res. Lett., 2021)

A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing. - Ruslan Sadykov; Eduardo Uchoa; Artur Alves Pessoa (Transp. Sci., 2021)

Solving real urban VRPTW instances by applying a Branch-Cut-and-Price via VRPsolver. - Thailsson Clementino; Juan Rosas; Rosiane de Freitas; Eduardo Uchoa (CLEI, 2022)

A unified exact approach for Clustered and Generalized Vehicle Routing Problems. - Matheus Freitas; João Marcos Pereira Silva; Eduardo Uchoa (Comput. Oper. Res., 2023)

Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems. - Pedro Henrique P. V. Liguori; Ali Ridha Mahjoub; Guillaume Marquès; Ruslan Sadykov; Eduardo Uchoa (Oper. Res., 2023)

A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem. - Caio Marinho Damião; João Marcos Pereira Silva; Eduardo Uchoa (4OR, 2023)

Solving vehicle routing problems with intermediate stops using VRPSolver models. - Marcos Costa Roboredo; Ruslan Sadykov; Eduardo Uchoa (Networks, 2023)

Branch-cut-and-price algorithms for two routing problems with hotel selection. - Marcos Costa Roboredo; Diogo Lima; João Marcos Pereira Silva; Eduardo Uchoa (Comput. Ind. Eng., 2024)

VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem. - Najib Errami; Eduardo Queiroga; Ruslan Sadykov; Eduardo Uchoa (INFORMS J. Comput., 2024)

Special Section on "DIMACS Implementation Challenge: Vehicle Routing" and "The EURO Meets NeurIPS 2022 Vehicle Routing Competition". - Claudia Archetti; Eduardo Uchoa; Thibaut Vidal (Transp. Sci., 2024)

A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery. - Rafael Praxedes; Teobaldo Bulhões; Anand Subramanian 001; Eduardo Uchoa (Comput. Oper. Res., 2024)

On the feasibility of solutions to the split delivery vehicle routing problem represented as edge variables. - Artur Alves Pessoa; Daniel De Araujo; Eduardo Uchoa (Oper. Res. Lett., 2025)

Instance space analysis of the capacitated vehicle routing problem. - Alessandra M. M. M. Gouvêa; Nuno Paulos; Eduardo Uchoa; Mariá C. V. Nascimento (CoRR, 2025)

The multiple steiner TSP with cyclic order on terminals: valid inequalities and polyhedra. - Ali Ridha Mahjoub; Raouia Taktak; Eduardo Uchoa (J. Comb. Optim., 2025)