✦ LIBER ✦

A note on the constrained shortest-path problem

✍ Scribed by Arun K. Pujari; Suneeta Agarwal; V. P. Gulati

Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 135 KB
Volume: 31
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800310110

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The constrained shortest path problem

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

A note on k-shortest paths problem

✍ Nick Gravin; Ning Chen 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB 👁 1 views

It is well-known that in a directed graph, if deleting any edge will not affect the shortest distance between two specific vertices s and t, then there are two edge-disjoint paths from s to t and both of them are shortest paths. In this article, we generalize this to shortest k edgedisjoint s-t path

A note on the problem of updating shorte

A note on the problem of updating shortest paths

✍ Satoru Fujishige 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB 👁 1 views

A note on shortest path, assignment, and

A note on shortest path, assignment, and transportation problems

✍ A. J. Hoffman; H. M. Markowitz 📂 Article 📅 1963 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB 👁 1 views

The cardinality-constrained shortest pat

The cardinality-constrained shortest path problem in 2-graphs

✍ Geir Dahl; Bjørnar Realfsen 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB 👁 2 views

The approach-dependent, time-dependent,

The approach-dependent, time-dependent, label-constrained shortest path problem

✍ Hanif D. Sherali; Chawalit Jeenanunta; Antoine G. Hobeika 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB