A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs

Alexandre Salles da Cunha, Abilio Lucena, Nelson Maculan, Mauricio G. C. Resende. A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs. Discrete Applied Mathematics, 157(6):1198-1217, 2009. [doi]

Abstract

Abstract is missing.