✦ LIBER ✦

An Algorithm for finding the optimal path on a network with bans

✍ Scribed by V.F. Krivorotov

Publisher: Elsevier Science
Year: 1975
Weight: 648 KB
Volume: 15
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(75)90052-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for determining the shortes

An algorithm for determining the shortest path on a network graph

✍ S.M. Alekseeva; O.G. Alekseev 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 568 KB

An algorithm for determining the most re

An algorithm for determining the most reliable path of a network

✍ V.K. Jain; Krishna Gopal 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 156 KB

Decomposition algorithms for finding the

Decomposition algorithms for finding the shortest path between a source node and a sink node of a network

✍ Suleyman Tufekci 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB

A note on the primal-dual and out-of-kil

A note on the primal-dual and out-of-kilter algorithms for network optimization problems

✍ J. F. Shapiro 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 341 KB 👁 1 views

A simpleO(n2) algorithm for the all-pair

A simpleO(n2) algorithm for the all-pairs shortest path problem on an interval graph

✍ Mirchandani, Prakash 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 3 views

Let G denote an interval graph with n vertices and unit weight edges. In this paper, we present a simple O(n') algorithm for solving the all-pairs shortest path problem on graph G . A recent algorithm for this problem has the same time-complexity but is fairly complicated to describe. However, our a

An algorithm for finding the shortest el

An algorithm for finding the shortest element of a polyhedral set with application to lagrangian duality

✍ Mokhtar S Bazaraa; Jamie J Goode; Ronald L Rardin 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 453 KB