Insertion Heuristic for the Euclidean Steiner Tree Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F01%3APU21379" target="_blank" >RIV/00216305:26210/01:PU21379 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Insertion Heuristic for the Euclidean Steiner Tree Problem
Original language description
The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem is NP-hard, so polynomial-time approximations or heuristics are desired. In this paper, the Steiner insertion heuristic is presented and computational results for benchmarks from OR-Library are discussed.
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 XXIIIrd International Colloquium Advanced Simulation of Systems ASIS 2001
ISBN
80-85988-61-5
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
71-76
Publisher name
MARQ Ostrava
Place of publication
Ostrava
Event location
Velké Losiny
Event date
Sep 11, 2001
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—