Computing Near-Optimal Solutions to the Network Steiner Tree Problem Using Approximate and Heuristic Techniques
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F01%3APU21355" target="_blank" >RIV/00216305:26210/01:PU21355 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Computing Near-Optimal Solutions to the Network Steiner Tree Problem Using Approximate and Heuristic Techniques
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 13th International Conference PROCESS CONTROL ?01
ISBN
80-227-1542-5
ISSN
—
e-ISSN
—
Number of pages
11
Pages from-to
—
Publisher name
KIRP CHTF STU Bratislava
Place of publication
Bratislava
Event location
Štrbské Pleso, High Tatras
Event date
Jun 11, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—