✦ LIBER ✦

Shortest path algorithms for knapsack type problems

✍ Scribed by A. M. Frieze

Publisher: Springer-Verlag
Year: 1976
Tongue: English
Weight: 484 KB
Volume: 11
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01580382

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for shortest path pr

Parallel algorithms for shortest path problems in polygons

✍ Hossam ElGindy; Michael Goodrich 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 665 KB

Dual algorithms for the shortest path tr

Dual algorithms for the shortest path tree problem

✍ Pallottino, Stefano; Scutell�, Maria Grazia 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB 👁 2 views

We consider dual approaches for the Shortest Path Tree problem. After a brief introduction to the problem, we review the most important dual algorithms which have been described in the literature for its solution and propose a new family of dual ascent algorithms. In these algorithms, ''local'' and

Labeling algorithm for the shortest path

Labeling algorithm for the shortest path problem with

✍ Eliécer Gutiérrez; Andrés L. Medaglia 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 613 KB

An algorithm for the resource constraine

An algorithm for the resource constrained shortest path problem

✍ J. E. Beasley; N. Christofides 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 812 KB

A dual algorithm for the constrained sho

A dual algorithm for the constrained shortest path problem

✍ Gabriel Y. Handler; Israel Zang 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 878 KB

Parallel algorithms for the single sourc

Parallel algorithms for the single source shortest path problem

✍ P. Mateti; N. Deo 📂 Article 📅 1982 🏛 Springer Vienna 🌐 English ⚖ 880 KB