( en | de | ru )

 

Disambiguation of "Uchoa, Eduardo"

Author of the publication

copydeleteadd this publication to your clipboard
A grid-enabled distributed branch-and-bound algorithm with application on the Steiner Problem in graphs.

, , , , , and . Parallel Comput., 32 (9): 629-642 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Eduardo Ospina

Eduardo Klein

Eduardo Monari

Eduardo Maurô

Eduardo Portabella

 

Other publications of authors with the same name

A GRASP-based approach to the generalized minimum spanning tree problem., , , and . Expert Syst. Appl., 39 (3): 3526-3536 (2012)On the complete set packing and set partitioning polytopes: Properties and rank 1 facets., , , and . Oper. Res. Lett., 46 (4): 389-392 (2018)Distance Transformation for Network Design Problems., , , and . SIAM J. Optim., 29 (2): 1687-1713 (2019)A layered compact formulation for the Multiple Steiner TSP with Order constraints., , and . CoDIT, page 1462-1467. IEEE, (2019)On the exact solution of vehicle routing problems with backhauls., , , , , and . Eur. J. Oper. Res., 287 (1): 76-89 (2020)Column Generation Based Heuristic for a Helicopter Routing Problem., , and . WEA, volume 4007 of Lecture Notes in Computer Science, page 219-230. Springer, (2006)Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem., , and . INOC, volume 6701 of Lecture Notes in Computer Science, page 176-181. Springer, (2011)Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut., and . IPCO, volume 1610 of Lecture Notes in Computer Science, page 439-452. Springer, (1999)Improved Branch-Cut-and-Price for Capacitated Vehicle Routing., , , and . IPCO, volume 8494 of Lecture Notes in Computer Science, page 393-403. Springer, (2014)Solving real urban VRPTW instances by applying a Branch-Cut-and-Price via VRPsolver., , , and . CLEI, page 1-8. IEEE, (2022)