Publication detail

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

ŠEDA, M.

English title

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

Type

Peer-reviewed article not indexed in WoS or Scopus

Language

en

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 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.

Keywords in English

minimum spanning tree, Steiner tree, heuristics, fuzzy number

Released

2006-08-01

ISSN

1305-5313

Volume

14

Number

8

Pages from–to

22–

Pages count

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