Abstract
This paper deals with a Steiner tree-star problem that is a special case of the degree constrained node-weighted Steiner tree problem. This problem arises in the context of designing telecommunications networks for digital data service, provided by regional telephone companies. In this paper, we develop an effective branch and cut procedure coupled with a suitable separation procedure that identifies violated facets for fractional solutions to the relaxed formulation. Computational results indicate that large problem instances with up to 200 nodes can be solved within acceptable time bounds.
Original language | English |
---|---|
Pages (from-to) | 194-201 |
Number of pages | 8 |
Journal | INFORMS Journal on Computing |
Volume | 8 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1996 |
Keywords
- Branch and cut
- Digital data networks
- Node-weighted Steiner tree
- Polyhedral structure
- Telecommunications networks
ASJC Scopus subject areas
- Software
- Information Systems
- Computer Science Applications
- Management Science and Operations Research