𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A heuristic for the Steiner problem in graphs

✍ Scribed by B. N. Khoury; P. M. Pardalos

Publisher
Springer US
Year
1996
Tongue
English
Weight
482 KB
Volume
6
Category
Article
ISSN
0926-6003

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The pilot method: A strategy for heurist
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
✍ Duin, Cees; VoοΏ½, Stefan πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 140 KB πŸ‘ 2 views

As a metaheuristic to obtain solutions of enhanced quality, we formulate the so-called pilot method. It is a tempered greedy method that is to avoid the greedy trap by looking ahead for each possible choice (memorizing the best result). Repeatedly, a so-called master solution is modified, each time

The steiner problem in graphs
The steiner problem in graphs
✍ S. E. Dreyfus; R. A. Wagner πŸ“‚ Article πŸ“… 1971 πŸ› John Wiley and Sons 🌐 English βš– 567 KB
A tabu search heuristic for the Steiner
A tabu search heuristic for the Steiner Tree Problem
✍ Gendreau, Michel; Larochelle, Jean-Francois; SansοΏ½, Brunilde πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 342 KB πŸ‘ 2 views

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, such as ATM, since it appears as the inherent mathematical structure behind multicast communications. In this paper, we present a tabu se