✦ LIBER ✦

Two Variations of the Minimum Steiner Problem

✍ Scribed by Tsan-Sheng Hsu; Kuo-Hui Tsai; Da-Wei Wang; D. T. Lee

Publisher: Springer US
Year: 2005
Tongue: English
Weight: 292 KB
Volume: 9
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-005-5487-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Variations of the prize-collecting Stein

Variations of the prize-collecting Steiner tree problem

✍ 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_

Variable neighbourhood search for the mi

Variable neighbourhood search for the minimum labelling Steiner tree problem

✍ Sergio Consoli; Kenneth Darby-Dowman; Nenad Mladenović; José Andrés Moreno-Pérez 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 599 KB

Variational perturbations of the minimum

Variational perturbations of the minimum effort problem

✍ R. Lucchetti; F. Mignanego 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 504 KB

Discrete Particle Swarm Optimization for

Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem

✍ Sergio Consoli; José Andrés Moreno-Pérez; Kenneth Darby-Dowman; Nenad Mladenović 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 279 KB

Conversion of the Steiner Problem on the

Conversion of the Steiner Problem on the Euclidean Plane to the Steiner Problem on Graph

✍ D. T. Lotarev; A. P. Uzdemir 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 158 KB

On the equivalence of two variational pr

On the equivalence of two variational problems

✍ Giulia Treu; Mihai Vornicescu 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 121 KB