𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for the steiner problem in graphs

✍ Scribed by J. E. Beasley

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
579 KB
Volume
14
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An SST-based algorithm for the steiner p
An SST-based algorithm for the steiner problem in graphs
✍ J. E. Beasley πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 644 KB

In this paper we consider the Steiner problem in graphs which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph. We present a formulation of the problem as a shortest spanning tree (SST) problem with additional constraints. By relaxing these addition

A branch and cut algorithm for the Stein
A branch and cut algorithm for the Steiner problem in graphs
✍ Lucena, A.; Beasley, J. E. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 165 KB πŸ‘ 2 views

In this paper, we consider the Steiner problem in graphs, which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph with nonnegative edge costs. We use the formulation of this problem as a shortest spanning tree (SST) problem with additional constraint

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