Publication detail

An Algorithm for the Network Steiner Tree Problem with Fuzzy Edge Lengths

ŠEDA, M.

Original Title

An Algorithm for the Network Steiner Tree Problem with Fuzzy Edge Lengths

Type

journal article - other

Language

English

Original Abstract

In this paper, we deal with the Steiner tree problem (STP) on a graph in which a fuzzy number, instead of a real number, is assigned to each edge. We propose a modification of the shortest paths approximation based on the fuzzy shortest paths (FSP) evaluations. Since fuzzy min operation using the extension principle leads to nondominated solutions, we propose another approach to solving the FSP using Cheng's centroid point fuzzy ranking method

Key words in English

Steiner tree, single shortest path problem, fuzzy ranking, binary heap, priority queue

Authors

ŠEDA, M.

RIV year

2002

Released

1. 6. 2002

ISBN

0922-6389

Periodical

Frontiers in Artificial Intelligence and Applications

Year of study

76

Number

6

State

Kingdom of the Netherlands

Pages from

117

Pages to

123

Pages count

7

BibTex

@article{BUT40755,
  author="Miloš {Šeda}",
  title="An Algorithm for the Network Steiner Tree Problem with Fuzzy Edge Lengths",
  journal="Frontiers in Artificial Intelligence and Applications",
  year="2002",
  volume="76",
  number="6",
  pages="7",
  issn="0922-6389"
}