PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Mateus, Geraldo Robson"

Author of the publication

copydeleteadd this publication to your clipboard
Managing virtual network embedding through reconfiguration and expansion.

, , , and . Simulation, (2019)

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.

No persons found for author name Mateus, Geraldo Robson
add a person with the name Mateus, Geraldo Robson
 

Other publications of authors with the same name

A Branch-and-Bound Algorithm to Solve a Multi-level Network Optimization Problem., , and . J. Math. Model. Algorithms, 2 (1): 37-56 (2003)The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation., , , and . Discrete Applied Mathematics, 158 (12): 1305-1314 (2010)Hierarchical Tournament Selection Genetic Algorithm for the Vehicle Routing Problem with Time Windows., and . HIS, page 410-415. IEEE Computer Society, (2004)A Two-Phase Genetic and Set Partitioning Approach for the Vehicle Routing Problem with Time Windows., and . HIS, page 428-433. IEEE Computer Society, (2004)Topological Design of Resilient Heterogeneous Networks with QoS., , , and . SBRC, page 183-190. IEEE, (2014)A performance guarantee heuristic for electronic components placement problems including thermal effects., , , and . Computers & OR, (2005)Data dissemination based on the energy map., , , , , and . IEEE Communications Magazine, 43 (7): 134-143 (2005)An Optimal Node Scheduling for Flat Wireless Sensor Networks., , , and . ICN (1), volume 3420 of Lecture Notes in Computer Science, page 475-482. Springer, (2005)Managing virtual network embedding through reconfiguration and expansion., , , and . Simulation, (2019)Branch-and-cut algorithms for the -arborescence star problem., , and . Int. Trans. Oper. Res., 29 (4): 2374-2400 (2022)