✦ LIBER ✦

On an instance of the inverse shortest paths problem

✍ Scribed by D. Burton; Ph. L. Toint

Publisher: Springer-Verlag
Year: 1992
Tongue: English
Weight: 989 KB
Volume: 53
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01585693

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Inapproximability results for the invers

Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths

✍ Andreas Bley 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## Abstract We study the complexity of two inverse shortest paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph __D__ = (__V__, __A__), the task is to find positive integer arc lengths such that th

Complexity of some inverse shortest path

Complexity of some inverse shortest path lengths problems

✍ Tingting Cui; Dorit S. Hochbaum 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 262 KB

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 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

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

Solving the shortest-paths problem on bi

Solving the shortest-paths problem on bipartite permutation graphs efficiently

✍ Lin Chen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 498 KB