𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Steiner's problem in graphs and its implications

✍ Scribed by S. L. Hakimi

Publisher
John Wiley and Sons
Year
1971
Tongue
English
Weight
952 KB
Volume
1
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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
Tabu search for the Steiner problem in g
Tabu search for the Steiner problem in graphs
✍ Celso C. Ribeiro; MaurΓ­cio C. De Souza πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 143 KB πŸ‘ 2 views

Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum-weighted subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe a tabu search algorithm for the Steiner problem in graphs, based o

Some generalizations of the steiner prob
Some generalizations of the steiner problem in graphs
✍ C. W. Duin; A. Volgenant πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 562 KB

The Steiner Problem in Graphs (SP) is the problem of finding a set of edges with minimum total weight which connects a given subset of nodes in an edge-weighted (undirected) graph. In the more general Node-weighted Steiner Problem (NSP) also node weights are considered. A restricted minimum spanning

Solving Steiner tree problems in graphs
Solving Steiner tree problems in graphs to optimality
✍ Koch, T.; Martin, A. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 261 KB πŸ‘ 2 views

In this paper, we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphs. Our algorithm is based on an integer programming formulation for directed graphs and comprises preprocessing, separation algorithms, and primal heuristics. We are able to solve nea