𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch-and-cut algorithm for the Steiner tree problem with delays

✍ Scribed by V. Leggieri, M. Haouari, C. Triki

Book ID
118815421
Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
284 KB
Volume
6
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A branch-and-cut algorithm for solving g
A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
✍ Suhl, Uwe H.; Hilbert, Heinrich πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 163 KB πŸ‘ 2 views

Given is an undirected graph with positive or negative edge weights which represent a profit if an investment such as installing a gas pipe takes place in a given time period. A certain part of the graph may already be piped in previous periods. The task is to extend the piped subgraph in the most p