Strong lower bounds for the prize collecting Steiner problem in graphs.

Abilio Lucena Mauricio G. C. Resende

Published in: Discret. Appl. Math. (2004)

Keyphrases

prize collecting
lower bound
upper bound
branch and bound algorithm
branch and bound
graph matching
objective function
np hard
graph theory
travel time
vc dimension
weighted graph
minimum spanning tree
computational complexity
cost function
worst case