Decomposition methods for the two-stage stochastic Steiner tree problem

ILP formulations for the two-stage stochastic Steiner tree problem

We give an overview of new and existing cutand flow-based ILP formulations for the two-stage stochastic Steiner tree problem and compare the strength of the LP relaxations.

Two Heuristics for the Steiner Tree Problem

The Steiner tree problem is to nd the tree with minimal Euclidean length spanning a set of xed points in the plane, given the ability to add points (Steiner points). The problem is NP-hard, so polynomial-time heuristics are desired. We present two such heuristics, both of which utilize an eecient method for computing a locally optimal tree with a given topology. The rst systematically inserts S...

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut

We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage when only probabilistic information on the set of terminals and the future edge costs is known. In the second stage, one of the given scenarios is realized and additional edges are purchased to interconnect the set of (now known)...

Decomposition Methods for Two-Stage Stochastic Integer Programs

A Heuristic Approach for the Stochastic Steiner Tree Problem

This paper addresses the two-stage stochastic Steiner tree problem (SSTP), which is one of the Steiner problems that belongs to the 11th DIMACS challenge. In the SSTP there is a finite number of scenarios in which the terminal set and the edge costs are subject to uncertainty. In the first stage, we have the probabilistic information in terms of possible scenarios. A scenario specifies a termin...