On the prize-collecting generalized minimum spanning tree problem

Annals of Operations Research

Volumn 150, Issue 1, 2007, Pages 193-204

  Pop, P C ^a  

^a TECHNICAL UNIVERSITY OF CLUJ NAPOCA   (Romania)

Author keywords

Combinatorial optimization; Generalized minimum spanning tree problem; Linear relaxation; Minimum spanning trees

Indexed keywords

EID: 33846890895     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-006-0153-1     Document Type: Article

References (8)

1. Dror, M., M. Haouari, and J. Chaouachi. (2000). "Generalized Spanning Trees." European Journal of Operational Research, 120, 583-592.
2. Feremans, C. (2001). Generalized Spanning Trees and Extensions. Belgium: PhD Thesis, Universite Libré de Bruxelles.
3. Feremans, C., M. Labbé, and G. Laporte, A. (2002). "Comparative Analysis of Several Formulations for the Generalized Minimum Spanning Tree Problem." Networks, 39(1), 29-34.
4. Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, California, Freeman.
5. Myung, Y.S., C.H. Lee, and D.w. Tcha. (1995). "On the Generalized Minimum Spanning Tree Problem." Networks, 26, 513-623.
6. Pop, P.C. (2002). The Generalized Minimum Spanning Tree Problem, PhD Thesis. The Netherlands: University of Twente.
7. Stanojevic, D., B. Golden, and S. Raghavan. (2004). " The Prize-Collecting Generalized Minimum Spanning Tree Problem." 7th INFORMS Tellecomucations Conference, Boca Raton, Florida.
8. Yannakakis, M. (1991). "Expressing Combinatorial Optimization Problems by Linear Programs." Journal of Computer and System Sciences, 43, 441-466.