The fuzzy shortest path problem and its most vital arcs

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[3]  D. Dubois,et al.  Algorithmes de plus courts chemins pour traiter des données floues , 1978 .

[4]  Didier Dubois,et al.  Fuzzy sets and systems ' . Theory and applications , 2007 .

[5]  H. W. Corley,et al.  Most vital links and nodes in weighted networks , 1982, Oper. Res. Lett..

[6]  Stefan Chanas,et al.  Maximum flow in a network with fuzzy arc capacities , 1982 .

[7]  Milan Mare,et al.  Fuzzy quantities in networks , 1983 .

[8]  S. Chanas,et al.  Real-valued flows in a network with fuzzy arc capacities , 1984 .

[9]  J. Verdegay.  A dual approach to solve the fuzzy linear programming problem , 1984 .

[10]  S. Chanas,et al.  A fuzzy approach to the transportation problem , 1984 .

[11]  G. Bortolan,et al.  A review of some methods for ranking fuzzy subsets , 1985 .

[12]  J. Kacprzyk,et al.  Optimization Models Using Fuzzy Sets and Possibility Theory , 1987 .

[13]  Miguel Delgado,et al.  Fuzzy Transportation Problems: A General Analysis , 1987 .

[14]  S. Chanas.  Fuzzy Optimization in Networks , 1987 .

[15]  R. Vohra,et al.  Finding the most vital arcs in a network , 1989 .

[16]  A. K. Mittal,et al.  The k most vital arcs in the shortest path problem , 1990 .

[17]  Donald Goldfarb,et al.  Efficient Shortest Path Simplex Algorithms , 1990, Oper. Res..

[18]  Mao-Jiun J. Wang,et al.  Ranking fuzzy numbers with integral value , 1992 .

[19]  H. Zimmermann,et al.  Fuzzy Set Theory and Its Applications , 1993 .