Back to Search
Start Over
A Branch and Cut Algorithm for a Steiner Tree--Star Problem.
- Source :
-
INFORMS Journal on Computing . Summer96, Vol. 8 Issue 3, p194. 8p. - Publication Year :
- 1996
-
Abstract
- Presents a branch and cut algorithm for a Steiner tree-star (STS) problem in the design of telecommunication networks for digital data service. Identification of violated facets for fractional solution to relaxed formulation; Computational complexity of STS problem; Node-weighted Steiner tree.
Details
- Language :
- English
- ISSN :
- 10919856
- Volume :
- 8
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- INFORMS Journal on Computing
- Publication Type :
- Academic Journal
- Accession number :
- 6723449
- Full Text :
- https://doi.org/10.1287/ijoc.8.3.194