Maximum flow in a network with fuzzy arc capacities
✍ Scribed by Stefan Chanas; Waldemar Kołodziejczyk
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 575 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0165-0114
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## a b s t r a c t We are concerned with the design of a model and an algorithm for computing a shortest path in a network having various types of fuzzy arc lengths. First, we develop a new technique for the addition of various fuzzy numbers in a path using α-cuts by proposing a linear least squar
We concentrate on a shortest path problem on a network in which a fuzzy number, instead of a real number, is assigned to each arc length. Introducing an order relation between fuzzy numbers based on "fuzzy min", a nondominated path or Pareto Optimal path from the speciÿed node to every other node is