✦ LIBER ✦

LP formulations of the shortest path tree problem

✍ Scribed by Jakob Krarup; Malene Nordlund Rørbech

Book ID: 106308125
Publisher: Springer
Year: 2004
Tongue: English
Weight: 131 KB
Volume: 2
Category: Article
ISSN: 1619-4500
DOI: 10.1007/s10288-004-0048-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Shortest shortest path trees of a networ

Shortest shortest path trees of a network

✍ Pierre Hansen; Maolin Zheng 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 664 KB

The constrained shortest path problem

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

Exact and Approximate Truthful Mechanism

Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem

✍ Luciano Gualà; Guido Proietti 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 504 KB

Efficient truthful mechanisms for the si

Efficient truthful mechanisms for the single-source shortest paths tree problem

✍ L. Gualà; G. Proietti 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB

The minimum cost shortest-path tree game

✍ F. R. Fernández, J. Puerto 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 387 KB