.png){kind=icon}
Return
A CONSTRAINED STEINER TREE PROBLEM
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(93)E0245-S.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Steiner tree problem on a graph involves finding a minimum cost tree which connects a designated subset of the nodes in the graph. Variants of the basic Steiner tree model can arise in the design of telecommunication networks where customers must be connected to a switching center. In this paper, we consider the constrained Steiner tree problem which is the Steiner tree problem on a graph with one additional side constraint that imposes a budget on the total amount of a resource (e.g., employee maintenance time) required by the arcs in the solution. We discuss various problem formulations, decomposition based solution approaches, and computational experience with the proposed methods.
Keywords:
INTEGER PROGRAMMING
RELAXATION
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveA weighted cooperative spectrum sensing framework for infrastructure-based cognitive radio networks
PREAI
ShareSaveShareSaveShareSave
View more