Detail publikace

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

ŠEDA, M.

Originální název

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

Typ

článek v časopise - ostatní, Jost

Jazyk

angličtina

Originální abstrakt

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

Klíčová slova v angličtině

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

Autoři

ŠEDA, M.

Rok RIV

2002

Vydáno

1. 6. 2002

ISSN

0922-6389

Periodikum

Frontiers in Artificial Intelligence and Applications

Ročník

76

Číslo

6

Stát

Nizozemsko

Strany od

117

Strany do

123

Strany počet

7

BibTex

@article{BUT40759,
  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"
}