## Search

Now showing items 1-5 of 5

#### Strength of three MIP formulations for the prize collecting steiner tree problem with a quota constraint

(Elsevier, 2010-08-01)

This paper investigates the quota version of the Prize Collecting Steiner Tree Problem (PCSTP) on a graph as a generalization of the well-known Steiner tree problem. For this challenging network design problem that arises ...

#### Tight compact models and comparative analysis for the prize collecting Steiner tree problem

(Elsevier, 2013-03)

We investigate a generalized version of the prize collecting Steiner tree problem (PCSTP), where each node of a given weighted graph is associated with a prize as well as a penalty cost. The problem is to find a tree ...

#### The Steiner tree problem with delays: a compact formulation and reduction procedures

(Elsevier, 2014-02-19)

This paper investigates the Steiner Tree Problem with Delays (STPD), a variation of the classical Steiner Tree problem that arises in multicast routing. We propose an exact solution approach that is based on a polynomial-size ...

#### An exact algorithm for the Steiner tree problem with delays

(Elsevier, 2010-08-01)

The Steiner Tree Problem with Delays (STPD) is a variant of the well-known Steiner Tree Problem in which the delay on each path between a source node and a terminal node is limited by a given maximum value. We propose a ...

#### Solving the steiner tree problem with revenues, budget and hop constraints to optimality

(IEEE, 2013)

We investigate the Steiner tree problem with revenues, budget and hop constraints (STPRBH) on graph, which is a generalization of the well-known Steiner tree problem. Given a root node, edge costs, nodes revenues, as well ...

Share this page