✦ LIBER ✦

The fuzzy shortest path length and the corresponding shortest path in a network

✍ Scribed by Tzung-Nan Chuang; Jung-Yuan Kung

Book ID: 108105604
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 262 KB
Volume: 32
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2003.11.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A shortest path problem on a network wit

A shortest path problem on a network with fuzzy arc lengths

✍ Shinkoh Okada; Timothy Soper 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 187 KB

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

The shortest path problem with discrete

The shortest path problem with discrete fuzzy arc lengths

✍ Jung-Yuan Kung; Tzung-Nan Chuang 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 482 KB

The expected length of a shortest path

✍ Robert Davis; Armand Prieditis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 568 KB

Computing k-shortest path lengths in euc

Computing k-shortest path lengths in euclidean networks

✍ Christopher C. Skiscim; Bruce L. Golden 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 496 KB

Computing a fuzzy shortest path in a net

Computing a fuzzy shortest path in a network with mixed fuzzy arc lengths using -cuts

✍ Ali Tajdin; Iraj Mahdavi; Nezam Mahdavi-Amiri; Bahram Sadeghpour-Gildeh 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 533 KB

## 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

Inapproximability results for the invers

Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths

✍ Andreas Bley 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## Abstract We study the complexity of two inverse shortest paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph __D__ = (__V__, __A__), the task is to find positive integer arc lengths such that th