Publication detail

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

ŠEDA, M.

English title

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

Type

conference paper

Language

en

Original abstract

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.

English abstract

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.

Keywords in English

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

RIV year

2001

Released

01.06.2001

Publisher

KIRP CHTF STU Bratislava

Location

Bratislava

ISBN

80-227-1542-5

Book

Proceedings of the 13th International Conference PROCESS CONTROL ‘01

Pages count

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"
}