( 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 Maurô

Eduardo Monari

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)Distance Transformation for Network Design Problems., , , and . SIAM J. Optim., 29 (2): 1687-1713 (2019)On the complete set packing and set partitioning polytopes: Properties and rank 1 facets., , , and . Oper. Res. Lett., 46 (4): 389-392 (2018)A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery., , , and . Comput. Oper. Res., (February 2024)A facility location and installation of resources model for level of repair analysis., and . Eur. J. Oper. Res., 192 (2): 479-486 (2009)A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem., , and . 4OR, 21 (1): 47-71 (March 2023)The Team Orienteering Problem: Formulations and Branch-Cut and Price., , and . ATMOS, volume 14 of OASIcs, page 142-155. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, (2010)Primal Heuristics for Branch and Price: The Assets of Diving Methods., , , , and . INFORMS J. Comput., 31 (2): 251-267 (2019)On the Multiple Steiner Traveling Salesman Problem with Order Constraints., and . ISCO, volume 12176 of Lecture Notes in Computer Science, page 66-77. Springer, (2020)A hybrid algorithm for a class of vehicle routing problems., , and . Comput. Oper. Res., 40 (10): 2519-2531 (2013)