-Steiner trees via the primal-dual method and Lagrangean relaxation.

Fabián A. Chudak Tim Roughgarden David P. Williamson

Published in: Math. Program. (2004)

Keyphrases

cost function
linear programming
primal dual
dynamic programming
minimum spanning tree
simplex algorithm
objective function
linear program
convergence rate
interior point algorithm