Search
Now showing items 1-2 of 2
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 ...
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 ...
Share this page