Detail publikace

Fuzzy Shortest Paths Approximation for Solving the Fuzzy Steiner Tree Problem in Graphs

ŠEDA, M.

Anglický název

Fuzzy Shortest Paths Approximation for Solving the Fuzzy Steiner Tree Problem in Graphs

Typ

Článek recenzovaný mimo WoS a Scopus

Jazyk

en

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 a 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 anglicky

minimum spanning tree, Steiner tree, heuristics, fuzzy number

Vydáno

2006-08-01

ISSN

1305-5313

Ročník

14

Číslo

8

Strany od–do

22–

Počet stran

5

BIBTEX


@article{BUT43700,
  author="Miloš {Šeda}",
  title="Fuzzy Shortest Paths Approximation for Solving the Fuzzy Steiner Tree Problem in Graphs",
  journal="Transactions on Engineering, Computing and Technology",
  year="2006",
  volume="14",
  number="8",
  pages="5",
  issn="1305-5313"
}