On the prize-collecting generalized minimum spanning tree problem

P. Pop ()

Annals of Operations Research, 2007, vol. 150, issue 1, 193-204

Abstract: The prize-collecting generalized minimum spanning tree problem (PC-GMSTP), is a generalization of the generalized minimum spanning tree problem (GMSTP) and belongs to the hard core of $${\cal{NP}}$$ -hard problems. We describe an exact exponential time algorithm for the problem, as well we present several mixed integer and integer programming formulations of the PC-GMSTP. Moreover, we establish relationships between the polytopes corresponding to their linear relaxations and present an efficient solution procedure that finds the optimal solution of the PC-GMSTP for graphs with up 240 nodes. Copyright Springer Science+Business Media, LLC 2007

Keywords: Combinatorial optimization; Minimum spanning trees; Generalized minimum spanning tree problem; Linear relaxation (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-006-0153-1 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:150:y:2007:i:1:p:193-204:10.1007/s10479-006-0153-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-006-0153-1

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().