Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Eduardo Uchoa
2010 – today
- 2013
[j29]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)
[j28]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)
[c11]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. Annals OR 194(1): 399-412 (2012)
[j26]Hugo H. Kramer, Vinicius Petrucci, Anand Subramanian, Eduardo Uchoa: A column generation approach for power-aware optimization of virtualized heterogeneous server clusters. Computers & Industrial Engineering 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. European Journal of Operational Research 221(2): 285-295 (2012)
[j24]Cristiane S. Ferreira, Luiz Satoru Ochi, Victor 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 Journal of Experimental 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 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)
[c10]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 Maria de A. Drummond, Luiz Satoru Ochi, Célio Albuquerque, Eduardo Uchoa: Solving Replica Placement and Request Distribution in Content Distribution Networks. Electronic Notes in Discrete Mathematics 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 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 Maria de 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)
[c9]Eduardo Uchoa, Renato Fonseca F. Werneck: Fast Local Search for Steiner Trees in Graphs. ALENEX 2010: 1-10
[c8]Marcus Poggi de Aragão, Henrique Viana, Eduardo Uchoa: The Team Orienteering Problem: Formulations and Branch-Cut and Price. ATMOS 2010: 142-155
[c7]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
[c6]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. European Journal of Operational Research 192(2): 479-486 (2009)
[j13]Lúcia Maria de 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
[c5]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
[c4]Marcelo C. P. Santos, Lúcia Maria de A. Drummond, Eduardo Uchoa: A Distributed Primal-Dual Heuristic for Steiner Problems in Networks. WEA 2007: 175-188- 2006
[j10]Humberto Longo, Marcus Poggi de Aragão, Eduardo Uchoa: Solving capacitated arc routing problems using a transformation to the CVRP. Computers & OR 33: 1823-1837 (2006)
[j9]Ricardo Fukasawa, Humberto 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 Maria de 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 Computing 32(9): 629-642 (2006)
[c3]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. Electronic Notes in Discrete Mathematics 19: 389-395 (2005)- 2004
[c2]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]Ricardo Fukasawa, Marcus Poggi de Aragão, Oscar Porto, Eduardo Uchoa: Solving the Freight Car Flow Problem to Optimality. Electr. Notes Theor. Comput. Sci. 66(6): 42-52 (2002)
[j4]Celso C. Ribeiro, Eduardo Uchoa, Renato Fonseca F. Werneck: A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs. INFORMS Journal on Computing 14(3): 228-246 (2002)
[j3]Eduardo Uchoa, Marcus Poggi de Aragão, Celso C. Ribeiro: Preprocessing Steiner problems from VLSI layout. Networks 40(1): 38-50 (2002)- 2001
[j2]Marcus Poggi de Aragão, Eduardo Uchoa, Renato Fonseca F. Werneck: Dual Heuristics on the Exact Solution of Large Steiner Problems. Electronic Notes in Discrete Mathematics 7: 150-153 (2001)
1990 – 1999
- 1999
[j1]Marcus Poggi de Aragão, Eduardo Uchoa: The gamma-connected assignment problem. European Journal of Operational Research 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-23 22:17 CEST by the dblp team



