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

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F02%3APU31532" target="_blank" >RIV/00216305:26210/02:PU31532 - isvavai.cz</a>

Alternative codes found

RIV/00216305:26210/02:PU31554

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

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

Original language description

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

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BB - Applied statistics, operational research

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2002

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Frontiers in Artificial Intelligence and Applications

ISSN

0922-6389

e-ISSN

—

Volume of the periodical

76

Issue of the periodical within the volume

6

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

7

Pages from-to

117-123

UT code for WoS article

—

EID of the result in the Scopus database

—