Spanning tree problem on a fuzzy network

Fumihiko Shimada, Hiroaki Ishii, Takeshi Itoh

Research output: Contribution to conferencePaper

Abstract

Given a connected graph with edge costs, we seek a spanning tree with total cost as small as possible. In this paper, we introduce the existence possibilities of edges to the graph and define `the tree reliabilities' by them. Then, we consider bicriteria i.e., about minimization of the weights (in the original spanning tree problem) and maximization of the reliabilities, and formulate an extended model of the spanning tree problem as a bicriteria programming problem on a fuzzy network.

Original languageEnglish
Pages267-271
Number of pages5
Publication statusPublished - 1998
EventProceedings of the 1998 2nd International Conference on knowledge-Based Intelligent Electronic Systems (KES '98) - Adelaide, Aust
Duration: 1998 Apr 211998 Apr 23

Other

OtherProceedings of the 1998 2nd International Conference on knowledge-Based Intelligent Electronic Systems (KES '98)
CityAdelaide, Aust
Period98/4/2198/4/23

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Spanning tree problem on a fuzzy network'. Together they form a unique fingerprint.

  • Cite this

    Shimada, F., Ishii, H., & Itoh, T. (1998). Spanning tree problem on a fuzzy network. 267-271. Paper presented at Proceedings of the 1998 2nd International Conference on knowledge-Based Intelligent Electronic Systems (KES '98), Adelaide, Aust, .