Publication detail
Computing Near-Optimal Solutions to the Network Steiner Tree Problem Using Approximate and Heuristic Techniques
ŠEDA, M.
English title
Computing Near-Optimal Solutions to the Network Steiner Tree Problem Using Approximate and Heuristic Techniques
Type
Paper in proceedings (conference paper)
Language
en
Original abstract
This paper deals with the network Steiner tree problem. It proposes a mathematical model of this problem and its modification for including it in software package GAMS. As this optimisation tool is not able to find an optimum for larger instances in a reasonable amount of time we propose an approach that combines approximate and deterministic heuristic methods with stochastic heuristic techniques.
Released
2001-06-01
Publisher
KIRP CHTF STU Bratislava
Location
Bratislava
ISBN
80-227-1542-5
Book
Proceedings of the 13th International Conference PROCESS CONTROL ‘01
Pages from–to
121/1–
Pages count
11