𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fuzzy shortest path problem

✍ Scribed by Shinkoh Okada; Mitsuo Gen

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
269 KB
Volume
27
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Shortest paths in fuzzy weighted graphs
Shortest paths in fuzzy weighted graphs
✍ Chris Cornelis; Peter De Kesel; Etienne E. Kerre πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 232 KB

The task of finding shortest paths in weighted graphs is one of the archetypical problems encountered in the domain of combinatorial optimization and has been studied intensively over the past five decades. More recently, fuzzy weighted graphs, along with generalizations of algorithms for finding op

The constrained shortest path problem
The constrained shortest path problem
✍ Y. P. Aneja; K. P. K. Nair πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 368 KB
Recoverable robust shortest path problem
Recoverable robust shortest path problems
✍ Christina BΓΌsing πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 169 KB

## Abstract In this article, we investigate two different recoverable robust (RR) models to deal with cost uncertainties in a shortest path problem. RR extends the classical concept of robustness to deal with uncertainties by incorporating limited recovery actions after the full data are revealed.

On a multicriteria shortest path problem
On a multicriteria shortest path problem
✍ Ernesto QueirΓ³s Vieira Martins πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 617 KB