Detail publikace

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

ŠEDA, M.

Anglický název

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

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

Klíčová slova anglicky

minimum spanning tree, Steiner tree, approximate algorithm, stochastic heuristics

Rok RIV

2001

Vydáno

01.06.2001

Nakladatel

KIRP CHTF STU Bratislava

Místo

Bratislava

ISBN

80-227-1542-5

Kniha

Proceedings of the 13th International Conference PROCESS CONTROL ‘01

Počet stran

11

BIBTEX


@inproceedings{BUT6616,
  author="Miloš {Šeda},
  title="Computing Near-Optimal Solutions to the Network Steiner Tree Problem Using Approximate and Heuristic Techniques",
  booktitle="Proceedings of the 13th International Conference PROCESS CONTROL ‘01",
  year="2001",
  month="June",
  publisher="KIRP CHTF STU Bratislava",
  address="Bratislava",
  isbn="80-227-1542-5"
}