Computing Near-Optimal Solutions to the Network Steiner Tree Problem Using Approximate and Heuristic Techniques

Stať ve sborníku v databázi WoS či Scopus

en

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.

2001-06-01

KIRP CHTF STU Bratislava

Bratislava

80-227-1542-5

Proceedings of the 13th International Conference PROCESS CONTROL ‘01

121/1–

11