Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Xu-jin CHEN, Xiao-dong HU, Bi LI
Given a connected graph G = (V,E) with a nonnegative cost on each edge in E, a nonnegative prize at each vertex in V, and a target set V'⊆ V, the Prize Collecting Steiner Tree (PCST) problem is to find a tree T in G interconnecting all vertices of V' such that the total cost on edges in T minus the total prize at vertices in T is minimized. The PCST problem appears frequently in practice of operations research. While the problem is NP-hard in general, it is polynomial-time solvable when graphs G are restricted to series-parallel graphs.
In this paper, we study the PCST problem with interval costs and prizes, where edge e could be included in T by paying cost xe ∈ [ce-, ce+] while taking risk (ce+ -xe)/(ce+ -ce-) of malfunction at e, and vertex v could be asked for giving a prize yv ∈ [pv-, pv+] for its inclusion in T while taking risk (yv - pv-)/(pv+ - pv-) of refusal by v. We establish two risk models for the PCST problem with interval data. Under given budget upper bound on constructing tree T, one model aims at minimizing the maximum risk over edges and vertices in T and the other aims at minimizing the sum of risks over edges and vertices in T. We propose strongly polynomial-time algorithms solving these problems on series-parallel graphs to optimality. Our study shows that the risk models proposed have advantages over the existing robust optimization model, which often yields NP-hard problems even if the original optimization problems are polynomial-time solvable.
