On the prize-collecting generalized minimum spanning tree problem

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.