✦ LIBER ✦

The robust shortest path problem in series–parallel multidigraphs with interval data

✍ Scribed by Adam Kasperski; Paweł Zieliński

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 196 KB
Volume: 34
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2005.01.008

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper the robust shortest path problem in edge series-parallel multidigraphs with interval costs is examined. The maximal regret criterion is applied to calculate the optimal solution. It is shown that this problem is NP-hard. A pseudopolynomial algorithm for the studied problem is constructed.

📜 SIMILAR VOLUMES

The shortest path with at most / nodes i

The shortest path with at most / nodes in each of the series/parallel clusters

✍ Wen-Jui Li; H.-S. Jacob Tsao; Osman Ulular 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 777 KB

## Abstract We study two related __constrained shortest path problems__ in which the nodes are partitioned into series/parallel clusters. These and many other constrained shortest path problems occur in optimizing the layout of private networks embedded in a larger telecommunications network. The f