Probabilistic models for the Steiner Tree problem

Abstract

We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having its vertices associated with a probability of presence (independently each from another) in the second stage. A first-stage feasible solution on the input graph might become infeasible… (More)
DOI: 10.1002/net.20346

6 Figures and Tables

Topics

  • Presentations referencing similar topics