✦ LIBER ✦

The 2-path network problem

✍ Scribed by Geir Dahl; Bjarne Johannessen

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 149 KB
Volume: 43
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The shortest path problem on large-scale

The shortest path problem on large-scale real-road networks

✍ G.A. Klunder; H.N. Post 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB

Path problems in networks with vector-va

Path problems in networks with vector-valued edge weights

✍ Tayi, Giri K.; Rosenkrantz, Daniel J.; Ravi, S. S. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

We consider path problems in networks where each edge is associated with a vector of weights. One application where such path problems arise is in transporting hazardous materials. In that context, the network is embedded in a cluster of communities (or zones), and it is important to consider the im

Solving min-max shortest-path problems o

Solving min-max shortest-path problems on a network

✍ Ishwar Murthy; Shenq-Shyong Her 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 877 KB

In this article we consider the problem of determining a path between two nodes in a network that minimizes the maximum of r path length values associated with it. This problem has a direct application in scheduling. It also has indirect applications in a class of routing problems and when consideri

The probabilistic longest path problem

✍ Murat, C�cile; Paschos, Vangelis Th. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB

We study the probabilistic longest path problem. We propose a modification strategy adapting a solution for a deterministic instance to a solution for the probabilistic one, we compute the functional associated with this strategy, and we evaluate the complexities of computing this functional and of

The Exact Path Length Problem

✍ Matti Nykänen; Esko Ukkonen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 126 KB

We study a problem related to finding shortest paths in weighted graphs. We ask whether or not there is a path between two nodes that has a given total cost k. The edge weights of the graph can be both positive and negative integers or even integer vectors. We show that many variants of this problem

The constrained shortest path problem

✍ Y. P. Aneja; K. P. K. Nair 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB