On the prize-collecting generalized minimum spanning tree problem

Author： Pop P.  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.150, Iss.1, 2007-03, pp. : 193-204

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The geometric generalized minimum spanning tree problem with grid clustering

By Feremans Corinne  

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 4, Iss. 4, 2006-12 ,pp. : 319-329

Springer Publishing Company

Access to resources Recommend Favorite

On the Euclidean Minimum Spanning Tree Problem

By Rajasekaran Sanguthevar  

Computing Letters, Vol. 1, Iss. 1, 2005-01 ,pp. : 11-14

VSP

Access to resources Recommend Favorite

Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem

By Shyu S. J.  

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 15, Iss. 1, 2003-01 ,pp. : 103-112

Taylor & Francis Ltd

Access to resources Recommend Favorite

RAMP for the capacitated minimum spanning tree problem

By Rego Cesar  

Annals of Operations Research, Vol. 181, Iss. 1, 2010-12 ,pp. : 661-681

Springer Publishing Company

Access to resources Recommend Favorite

Euclidean Prize-Collecting Steiner Forest

By Bateni MohammadHossein   Hajiaghayi MohammadTaghi  

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 906-929

Springer Publishing Company

Access to resources Recommend Favorite