𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exploring the stratified shortest-paths problem

✍ Scribed by Timothy G. Griffin

Book ID
113109119
Publisher
Springer-Verlag
Year
2011
Weight
981 KB
Volume
1
Category
Article
ISSN
2076-0310

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The constrained shortest path problem
The constrained shortest path problem
✍ Y. P. Aneja; K. P. K. Nair πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 368 KB
Fuzzy shortest path problem
Fuzzy shortest path problem
✍ Shinkoh Okada; Mitsuo Gen πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 269 KB
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

The Minimum-Covering/Shortest-Path Probl
The Minimum-Covering/Shortest-Path Problem
✍ John Current; Charles ReVelle; Jared Cohon πŸ“‚ Article πŸ“… 1988 πŸ› Decision Sciences Institute, Georgia State Univers 🌐 English βš– 738 KB
Solving the shortest path tour problem
Solving the shortest path tour problem
✍ Festa, P.; Guerriero, F.; LaganΓ , D.; Musmanno, R. πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 856 KB