Exact approaches for solving robust prize-collecting Steiner tree problems
The paper deals with the Robust PCStT, addressing interval uncertainty on its data. Different mathematical programming formulations are proposed. Branch-and-cut Algorithms are designed and extensively tested. Recent theoretical results are adapted for the Robust PCStT and some of it variants.
interval uncertainty branch-and-cut prize collecting steiner trees robust optimization mixed integer programming