Fuzzy shortest paths
From MaRDI portal
Publication:805505
DOI10.1016/0165-0114(91)90063-VzbMath0728.90090MaRDI QIDQ805505
Publication date: 1991
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C70: Fuzzy and other nonstochastic uncertainty mathematical programming
90C39: Dynamic programming
Related Items
Modelling fuzzy universal resource identifiers: a first approach, Shortest path problem on a network with imprecise edge weight, Fuzzy shortest path problem with finite fuzzy quantities, New models for shortest path problem with fuzzy arc lengths, A fuzzy shortest path with the highest reliability, Modeling uncertainty in networks, Fuzzy dynamic programming: Main developments and applications, Generalized path-finding algorithms on semirings and the fuzzy shortest path problem., Fuzzy shortest path problems incorporating interactivity among paths., Unified approach to fuzzy graph problems, The fuzzy shortest path length and the corresponding shortest path in a network, A dynamic approach to multiple-objective resource allocation problem, Fuzzy decision networks and deconvolution, The shortest path problem on networks with fuzzy parameters, Fuzzy graphs modelling for hazmat telegeomonitoring, The shortest path problem with discrete fuzzy arc lengths, A new algorithm for the discrete fuzzy shortest path problem in a network
Cites Work
- Decompositions and range for additive fuzzy measures
- Fuzzy network technique for technological forecasting
- Real-valued flows in a network with fuzzy arc capacities
- Fuzzy multicriteria integer programming via fuzzy generalized networks
- Theory and applications of generalized dynamic programming: An overview
- Fuzzy decision trees
- Fuzzy sets and systems. Theory and applications
- The use of fuzzy variables in PERT
- Maximum flow in a network with fuzzy arc capacities
- Submodular systems and related topics
- Restricted simplicial decomposition: Computation and extensions
- Integer flows in network with fuzzy capacity constraints
- `` Strong NP-Completeness Results
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
