𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Haouari, Mohamed; Layeb, Safa Bhar; Sherali, Hanif D.


Book ID
123429397
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
284 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Variations of the prize-collecting Stein
✍ Olena Chapovska; Abraham P. Punnen πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

## Abstract The prize‐collecting Steiner tree problem is well known to be NP‐hard. We consider seven variations of this problem generalizing several well‐studied bottleneck and minsum problems with feasible solutions as trees of a graph. Four of these problems are shown to be solvable in __O__(__m_

Probabilistic models for the Steiner Tre
✍ Vangelis Th. Paschos; Orestis A. Telelis; Vassilis Zissimopoulos πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 216 KB