✦ LIBER ✦

A note on shortest path, assignment, and transportation problems

✍ Scribed by A. J. Hoffman; H. M. Markowitz

Publisher: John Wiley and Sons
Year: 1963
Tongue: English
Weight: 235 KB
Volume: 10
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800100132

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 constrained shortest-path

A note on the constrained shortest-path problem

✍ Arun K. Pujari; Suneeta Agarwal; V. P. Gulati 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 1 views

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 finding shortest path trees

✍ Aaron Kershenbaum 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 1 views

A note on Arc tolerances in sparse short

A note on Arc tolerances in sparse shortest-path and network flow problems

✍ Dan Gusfield 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 298 KB 👁 1 views

On the assignment and transportation pro

On the assignment and transportation problems (abstract)

✍ James Munkres 📂 Article 📅 1957 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 1 views

In this paper we presented an algorithm for the assignment problem which is a variant of H. W. Kuhn's so-called Hungarian method [ 11. We also gave a generalization of it to the transportation problem. Since a detailed exposition will appear elsewhere [ 23, we shall content ourselves here with a few