Stochastic Heuristic Methods for the Steiner Tree Problem in Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F01%3APU23161" target="_blank" >RIV/00216305:26210/01:PU23161 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
čeština
Original language name
Stochastic Heuristic Methods for the Steiner Tree Problem in Graphs
Original language description
The Steiner tree problem in graphs (SPG) is concerned with connecting a subset of vertices at minimal cost. More precisely, given an undirected connected graph G=(V,E) with vertex set V, edge set E, nonnegative weights associated with the edges, and a subset B of V (called customer vertices or terminals), the problem is to find a subgraph, T, which connects the vertices in B so that the sum of the weights of the edges in T is minimized. It is obvious that the solution is always a tree and it is called aa minimal Steiner tree for B in G. Applications of the SPG are frequently found in the layout of connection structures in networks and circuit design. Their common feature is that of connecting together a set of terminals (communications sites or circuits components) by a network of minimal total length. The contribution presents an application of stochastic heuristic methods in a combination with approximate algorithms and compares their effectiveness using standard benchmarks from OR-l
Czech name
Stochastic Heuristic Methods for the Steiner Tree Problem in Graphs
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
Abstracts of the European Operational Research Conference EURO 2001
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
1
Pages from-to
74-74
Publisher name
Netherlands Society for Operations Research
Place of publication
Rotterdam
Event location
Rotterdam
Event date
Jul 9, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—