default search action
Eduardo Uchoa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j68]Marcos Costa Roboredo, Diogo Lima, João Marcos Pereira Silva, Eduardo Uchoa:
Branch-cut-and-price algorithms for two routing problems with hotel selection. Comput. Ind. Eng. 196: 110467 (2024) - [j67]Rafael Praxedes, Teobaldo Bulhões, Anand Subramanian, Eduardo Uchoa:
A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery. Comput. Oper. Res. 162: 106467 (2024) - [j66]Najib Errami, Eduardo Queiroga, Ruslan Sadykov, Eduardo Uchoa:
VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem. INFORMS J. Comput. 36(4): 956-965 (2024) - [j65]Claudia Archetti, Eduardo Uchoa, Thibaut Vidal:
Special Section on "DIMACS Implementation Challenge: Vehicle Routing" and "The EURO Meets NeurIPS 2022 Vehicle Routing Competition". Transp. Sci. 58(4): 685-686 (2024) - 2023
- [j64]Caio Marinho Damião, João Marcos Pereira Silva, Eduardo Uchoa:
A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem. 4OR 21(1): 47-71 (2023) - [j63]Matheus Freitas, João Marcos Pereira Silva, Eduardo Uchoa:
A unified exact approach for Clustered and Generalized Vehicle Routing Problems. Comput. Oper. Res. 149: 106040 (2023) - [j62]Pedro Henrique P. V. Liguori, Ali Ridha Mahjoub, Guillaume Marquès, Ruslan Sadykov, Eduardo Uchoa:
Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems. Oper. Res. 71(5): 1577-1595 (2023) - [j61]Marcos Costa Roboredo, Ruslan Sadykov, Eduardo Uchoa:
Solving vehicle routing problems with intermediate stops using VRPSolver models. Networks 81(3): 399-416 (2023) - 2022
- [c18]Thailsson Clementino, Juan Rosas, Rosiane de Freitas, Eduardo Uchoa:
Solving real urban VRPTW instances by applying a Branch-Cut-and-Price via VRPsolver. CLEI 2022: 1-8 - 2021
- [j60]Eduardo Queiroga, Ruslan Sadykov, Eduardo Uchoa:
A POPMUSIC matheuristic for the capacitated vehicle routing problem. Comput. Oper. Res. 136: 105475 (2021) - [j59]Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa:
Solving Bin Packing Problems Using VRPSolver Models. Oper. Res. Forum 2(2) (2021) - [j58]Thiago Alcântara Luiz, Haroldo Gambini Santos, Eduardo Uchoa:
Cover by disjoint cliques cuts for the knapsack problem with conflicting items. Oper. Res. Lett. 49(6): 844-850 (2021) - [j57]Ruslan Sadykov, Eduardo Uchoa, Artur Alves Pessoa:
A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing. Transp. Sci. 55(1): 4-28 (2021) - 2020
- [j56]Luiz Henrique Barbosa, Eduardo Uchoa:
A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection. Comput. Oper. Res. 123: 104986 (2020) - [j55]Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot, Eduardo Uchoa:
Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut. Discret. Optim. 35: 100555 (2020) - [j54]Eduardo Queiroga, Yuri Frota, Ruslan Sadykov, Anand Subramanian, Eduardo Uchoa, Thibaut Vidal:
On the exact solution of vehicle routing problems with backhauls. Eur. J. Oper. Res. 287(1): 76-89 (2020) - [j53]Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck:
A generic exact solver for vehicle routing and related problems. Math. Program. 183(1): 483-523 (2020) - [j52]Teobaldo Bulhões, Ruslan Sadykov, Anand Subramanian, Eduardo Uchoa:
On the exact solution of a large class of parallel machine scheduling problems. J. Sched. 23(4): 411-429 (2020) - [j51]Virginie Gabrel, Ali Ridha Mahjoub, Raouia Taktak, Eduardo Uchoa:
The Multiple Steiner TSP with order constraints: complexity and optimization algorithms. Soft Comput. 24(23): 17957-17968 (2020) - [c17]Raouia Taktak, Eduardo Uchoa:
On the Multiple Steiner Traveling Salesman Problem with Order Constraints. ISCO 2020: 66-77
2010 – 2019
- 2019
- [j50]André Soares Velasco, Eduardo Uchoa:
Improved state space relaxation for constrained two-dimensional guillotine cutting problems. Eur. J. Oper. Res. 272(1): 106-120 (2019) - [j49]Ruslan Sadykov, François Vanderbeck, Artur Alves Pessoa, Issam Tahiri, Eduardo Uchoa:
Primal Heuristics for Branch and Price: The Assets of Diving Methods. INFORMS J. Comput. 31(2): 251-267 (2019) - [j48]Ali Ridha Mahjoub, Michael Poss, Luidi Simonetti, Eduardo Uchoa:
Distance Transformation for Network Design Problems. SIAM J. Optim. 29(2): 1687-1713 (2019) - [j47]Diego Pecin, Eduardo Uchoa:
Comparative Analysis of Capacitated Arc Routing Formulations for Designing a New Branch-Cut-and-Price Algorithm. Transp. Sci. 53(6): 1673-1694 (2019) - [c16]Ali Ridha Mahjoub, Raouia Taktak, Eduardo Uchoa:
A layered compact formulation for the Multiple Steiner TSP with Order constraints. CoDIT 2019: 1462-1467 - [c15]Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck:
A Generic Exact Solver for Vehicle Routing and Related Problems. IPCO 2019: 354-369 - 2018
- [j46]Teobaldo Bulhões, Ruslan Sadykov, Eduardo Uchoa:
A branch-and-price algorithm for the Minimum Latency Problem. Comput. Oper. Res. 93: 66-78 (2018) - [j45]Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa:
Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems. Eur. J. Oper. Res. 270(2): 530-543 (2018) - [j44]Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck:
Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation. INFORMS J. Comput. 30(2): 339-360 (2018) - [j43]Thomas Pajor, Eduardo Uchoa, Renato F. Werneck:
A robust and scalable algorithm for the Steiner problem in graphs. Math. Program. Comput. 10(1): 69-118 (2018) - [j42]Teobaldo Bulhões, Artur Alves Pessoa, Fábio Protti, Eduardo Uchoa:
On the complete set packing and set partitioning polytopes: Properties and rank 1 facets. Oper. Res. Lett. 46(4): 389-392 (2018) - 2017
- [j41]Eduardo Uchoa, Diego Pecin, Artur Alves Pessoa, Marcus Poggi, Thibaut Vidal, Anand Subramanian:
New benchmark instances for the Capacitated Vehicle Routing Problem. Eur. J. Oper. Res. 257(3): 845-858 (2017) - [j40]Diego Pecin, Claudio Contardo, Guy Desaulniers, Eduardo Uchoa:
New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows. INFORMS J. Comput. 29(3): 489-502 (2017) - [j39]Diego Pecin, Artur Alves Pessoa, Marcus Poggi, Eduardo Uchoa:
Improved branch-cut-and-price for capacitated vehicle routing. Math. Program. Comput. 9(1): 61-100 (2017) - [j38]Diego Pecin, Artur Alves Pessoa, Marcus Poggi, Eduardo Uchoa, Haroldo G. Santos:
Limited memory Rank-1 Cuts for Vehicle Routing Problems. Oper. Res. Lett. 45(3): 206-209 (2017) - 2016
- [j37]Hugo Harry Kramer, Eduardo Uchoa, Marcia Fampa, Viviane Köhler, François Vanderbeck:
Column generation approaches for the software clustering problem. Comput. Optim. Appl. 64(3): 843-864 (2016) - [j36]Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot, Eduardo Uchoa:
Unsplittable non-additive capacitated network design using set functions polyhedra. Comput. Oper. Res. 66: 105-115 (2016) - 2014
- [j35]Maria Battarra, Artur Alves Pessoa, Anand Subramanian, Eduardo Uchoa:
Exact algorithms for the traveling salesman problem with draft limits. Eur. J. Oper. Res. 235(1): 115-128 (2014) - [j34]Luiz Aizemberg, Hugo Harry Kramer, Artur Alves Pessoa, Eduardo Uchoa:
Formulations for a problem of petroleum transportation. Eur. J. Oper. Res. 237(1): 82-90 (2014) - [j33]Nelson Maculan, Ali Ridha Mahjoub, Eduardo Uchoa:
Preface. RAIRO Oper. Res. 48(2): 151-152 (2014) - [c14]Diego Pecin, Artur Alves Pessoa, Marcus Poggi, Eduardo Uchoa:
Improved Branch-Cut-and-Price for Capacitated Vehicle Routing. IPCO 2014: 393-403 - [p1]Marcus Poggi, Eduardo Uchoa:
New Exact Algorithms for the Capacitated Vehicle Routing Problem. Vehicle Routing 2014: 59-86 - [i1]Thomas Pajor, Eduardo Uchoa, Renato F. Werneck:
A Robust and Scalable Algorithm for the Steiner Problem in Graphs. CoRR abs/1412.2787 (2014) - 2013
- [j32]Anand Subramanian, Eduardo Uchoa, Luiz Satoru Ochi:
A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40(10): 2519-2531 (2013) - [j31]Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot, Eduardo Uchoa:
Capacitated Network Design using Bin-Packing. Electron. Notes Discret. Math. 41: 479-486 (2013) - [j30]Hernán G. Abeledo, Ricardo Fukasawa, Artur Alves Pessoa, Eduardo Uchoa:
The time dependent traveling salesman problem: polyhedra and algorithm. Math. Program. Comput. 5(1): 27-55 (2013) - [j29]Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa:
Hop-level flow formulation for the survivable network design with hop constraints problem. Networks 61(2): 171-179 (2013) - [j28]Anand Subramanian, Eduardo Uchoa, Artur Alves Pessoa, Luiz Satoru Ochi:
Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery. Optim. Lett. 7(7): 1569-1581 (2013) - [c13]Rainer Amorim, Bruno Dias, Rosiane de Freitas Rodrigues, Eduardo Uchoa:
A hybrid genetic algorithm with local search approach for E/T scheduling problems on identical parallel machines. GECCO (Companion) 2013: 63-64 - [c12]Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck:
In-Out Separation and Column Generation Stabilization by Dual Price Smoothing. SEA 2013: 354-365 - 2012
- [j27]Haroldo G. Santos, Eduardo Uchoa, Luiz Satoru Ochi, Nelson Maculan:
Strong bounds with cut and column generation for class-teacher timetabling. Ann. Oper. Res. 194(1): 399-412 (2012) - [j26]Hugo Harry Kramer, Vinicius Petrucci, Anand Subramanian, Eduardo Uchoa:
A column generation approach for power-aware optimization of virtualized heterogeneous server clusters. Comput. Ind. Eng. 63(3): 652-662 (2012) - [j25]Anand Subramanian, Puca Huachi Vaz Penna, Eduardo Uchoa, Luiz Satoru Ochi:
A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem. Eur. J. Oper. Res. 221(2): 285-295 (2012) - [j24]Cristiane Ferreira, Luiz Satoru Ochi, Víctor Parada, Eduardo Uchoa:
A GRASP-based approach to the generalized minimum spanning tree problem. Expert Syst. Appl. 39(3): 3526-3536 (2012) - [j23]Eduardo Uchoa, Renato Fonseca F. Werneck:
Fast local search for the steiner problem in graphs. ACM J. Exp. Algorithmics 17(1) (2012) - [j22]Eduardo Uchoa, Túlio A. M. Toffolo, Maurício C. de Souza, Alexandre Xavier Martins, Ricardo Fukasawa:
Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem. Networks 59(1): 148-160 (2012) - 2011
- [j21]Luis Eduardo Neves Gouveia, Luidi Simonetti, Eduardo Uchoa:
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. Math. Program. 128(1-2): 123-148 (2011) - [j20]Anand Subramanian, Eduardo Uchoa, Artur Alves Pessoa, Luiz Satoru Ochi:
Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery. Oper. Res. Lett. 39(5): 338-341 (2011) - [c11]Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa:
Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem. INOC 2011: 176-181 - 2010
- [j19]Tiago Araújo Neves, Lúcia M. A. Drummond, Luiz Satoru Ochi, Célio Albuquerque, Eduardo Uchoa:
Solving Replica Placement and Request Distribution in Content Distribution Networks. Electron. Notes Discret. Math. 36: 89-96 (2010) - [j18]Fernanda Menezes, Oscar Porto, Marcelo L. Reis, Lorenza Moreno, Marcus Poggi de Aragão, Eduardo Uchoa, Hernán G. Abeledo, Nelci Carvalho do Nascimento:
Optimizing Helicopter Transport of Oil Rig Crews at Petrobras. Interfaces 40(5): 408-416 (2010) - [j17]Artur Alves Pessoa, Eduardo Uchoa, Marcus Poggi de Aragão, Rosiane de Freitas Rodrigues:
Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems. Math. Program. Comput. 2(3-4): 259-290 (2010) - [j16]Marcelo C. P. Santos, Lúcia M. A. Drummond, Eduardo Uchoa:
A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem. Oper. Res. Lett. 38(1): 57-62 (2010) - [j15]Lorenza Moreno, Marcus Poggi de Aragão, Eduardo Uchoa:
Improved lower bounds for the Split Delivery Vehicle Routing Problem. Oper. Res. Lett. 38(4): 302-306 (2010) - [c10]Eduardo Uchoa, Renato Fonseca F. Werneck:
Fast Local Search for Steiner Trees in Graphs. ALENEX 2010: 1-10 - [c9]Marcus Poggi de Aragão, Henrique Viana, Eduardo Uchoa:
The Team Orienteering Problem: Formulations and Branch-Cut and Price. ATMOS 2010: 142-155 - [c8]Hernán G. Abeledo, Ricardo Fukasawa, Artur Alves Pessoa, Eduardo Uchoa:
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm. SEA 2010: 202-213 - [c7]Anand Subramanian, Eduardo Uchoa, Luiz Satoru Ochi:
New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery. SEA 2010: 276-287
2000 – 2009
- 2009
- [j14]Eduardo Siqueira Brick, Eduardo Uchoa:
A facility location and installation of resources model for level of repair analysis. Eur. J. Oper. Res. 192(2): 479-486 (2009) - [j13]Lúcia M. A. Drummond, Marcelo C. P. Santos, Eduardo Uchoa:
A distributed dual ascent algorithm for Steiner problems in multicast routing. Networks 53(2): 170-183 (2009) - [j12]Artur Alves Pessoa, Eduardo Uchoa, Marcus Poggi de Aragão:
A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Networks 54(4): 167-177 (2009) - 2008
- [j11]Eduardo Uchoa, Ricardo Fukasawa, Jens Lysgaard, Artur Alves Pessoa, Marcus Poggi de Aragão, Diogo Andrade:
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation. Math. Program. 112(2): 443-472 (2008) - 2007
- [c6]Artur Alves Pessoa, Marcus Poggi de Aragão, Eduardo Uchoa:
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem. WEA 2007: 150-160 - [c5]Marcelo C. P. Santos, Lúcia M. A. Drummond, Eduardo Uchoa:
A Distributed Primal-Dual Heuristic for Steiner Problems in Networks. WEA 2007: 175-188 - 2006
- [j10]Humberto J. Longo, Marcus Poggi de Aragão, Eduardo Uchoa:
Solving capacitated arc routing problems using a transformation to the CVRP. Comput. Oper. Res. 33: 1823-1837 (2006) - [j9]Ricardo Fukasawa, Humberto J. Longo, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo L. Reis, Eduardo Uchoa, Renato Fonseca F. Werneck:
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. Math. Program. 106(3): 491-511 (2006) - [j8]Eduardo Uchoa:
Reduction tests for the prize-collecting Steiner problem. Oper. Res. Lett. 34(4): 437-444 (2006) - [j7]Lúcia M. A. Drummond, Eduardo Uchoa, Alexandre D. Gonçalves, Juliana M. N. Silva, Marcelo C. P. Santos, Maria Clicia Stelling de Castro:
A grid-enabled distributed branch-and-bound algorithm with application on the Steiner Problem in graphs. Parallel Comput. 32(9): 629-642 (2006) - [c4]Lorenza Moreno, Marcus Poggi de Aragão, Eduardo Uchoa:
Column Generation Based Heuristic for a Helicopter Routing Problem. WEA 2006: 219-230 - 2005
- [j6]Alexandre Pigatti, Marcus Poggi de Aragão, Eduardo Uchoa:
Stabilized branch-and-cut-and-price for the generalized assignment problem. Electron. Notes Discret. Math. 19: 389-395 (2005) - 2004
- [c3]Ricardo Fukasawa, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo L. Reis, Eduardo Uchoa, Renato Fonseca F. Werneck:
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. IPCO 2004: 1-15 - 2002
- [j5]Celso C. Ribeiro, Eduardo Uchoa, Renato Fonseca F. Werneck:
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs. INFORMS J. Comput. 14(3): 228-246 (2002) - [j4]Eduardo Uchoa, Marcus Poggi de Aragão, Celso C. Ribeiro:
Preprocessing Steiner problems from VLSI layout. Networks 40(1): 38-50 (2002) - [c2]Ricardo Fukasawa, Marcus Poggi de Aragão, Oscar Porto, Eduardo Uchoa:
Solving the Freight Car Flow Problem to Optimality. ATMOS 2002: 42-52 - 2001
- [j3]Marcus Poggi de Aragão, Eduardo Uchoa, Renato Fonseca F. Werneck:
Dual Heuristics on the Exact Solution of Large Steiner Problems. Electron. Notes Discret. Math. 7: 150-153 (2001) - [j2]Eduardo Uchoa, Marcus Poggi de Aragão:
Vertex-Disjoint Packing of Two Steiner Trees: polyhedra and branch-and-cut. Math. Program. 90(3): 537-557 (2001)
1990 – 1999
- 1999
- [j1]Marcus Poggi de Aragão, Eduardo Uchoa:
The gamma-connected assignment problem. Eur. J. Oper. Res. 118(1): 127-138 (1999) - [c1]Eduardo Uchoa, Marcus Poggi de Aragão:
Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut. IPCO 1999: 439-452
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint