Marcelo C. P. Santos

According to our database, Marcelo C. P. Santos authored at least 4 papers between 2006 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2010

A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem.

Marcelo C. P. Santos, Lúcia M. A. Drummond, Eduardo Uchoa

Oper. Res. Lett., 2010

2009

A distributed dual ascent algorithm for Steiner problems in multicast routing.

Lúcia M. A. Drummond, Marcelo C. P. Santos, Eduardo Uchoa

Networks, 2009

2007

A Distributed Primal-Dual Heuristic for Steiner Problems in Networks.

Marcelo C. P. Santos, Lúcia M. A. Drummond, Eduardo Uchoa

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

2006

A grid-enabled distributed branch-and-bound algorithm with application on the Steiner Problem in graphs.

Lúcia M. A. Drummond, Eduardo Uchoa, Alexandre D. Gonçalves, Juliana M. N. Silva, Marcelo C. P. Santos, Maria Clicia Stelling de Castro

Parallel Comput., 2006