New Bundle Methods for Solving Lagrangian Relaxation Dual Problems

By Zhao X.   Luh P.B.  

Journal of Optimization Theory and Applications, Vol. 113, Iss. 2, 2002-05 ,pp. : 373-397

Springer Publishing Company

Access to resources Recommend Favorite

OPTIMAL SEQUENTIAL AND PARALLEL ALGORITHMS TO COMPUTE A STEINER TREE ON PERMUTATION GRAPHS

By MONDAL S.   PAL M.   PAL T.  

International Journal of Computer Mathematics, Vol. 80, Iss. 8, 2003-08 ,pp. : 937-943

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solving the p-Median Problem with a Semi-Lagrangian Relaxation

By Beltran C.   Tadonki C.   Vial J.  

Computational Optimization and Applications, Vol. 35, Iss. 2, 2006-10 ,pp. : 239-260

Springer Publishing Company

Access to resources Recommend Favorite

On reductions for the Steiner Problem in Graphs

By Kingston J.H.   Sheppard N.P.  

Journal of Discrete Algorithms, Vol. 1, Iss. 1, 2003-02 ,pp. : 77-88

Elsevier

Access to resources Recommend Favorite

The Polymatroid Steiner Problems

By Calinescu G.   Zelikovsky A.  

Journal of Combinatorial Optimization, Vol. 9, Iss. 3, 2005-05 ,pp. : 281-294

Springer Publishing Company

Access to resources Recommend Favorite