A Steiner point candidate-based heuristic framework for the Steiner tree problem in graphs
The underlying models of many practical problems in various engineering fields are equivalent to the Steiner tree problem in graphs, which is a typical NP-hard combinatorial optimization problem. Thus, developing a fast and effective heuristic for the Steiner tree problem in graphs is of universal s...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SAGE Publishing
2016-06-01
|
| Series: | Journal of Algorithms & Computational Technology |
| Online Access: | https://doi.org/10.1177/1748301816640714 |