Abstract
A generalization of the concept of a path in a directed graph, called a hyperpath, is the object of this paper. Fundamental properties of a path are generalized for a hyperpath. In particular, the shortest hyperpath problem is studied for a subclass of hyperpaths. Shortest hyperpath properties are derived from the classical one, and efficient algorithms are presented in detail.
Keywords
- Characteristic Vector
- Path Cost
- Oriented Graph
- Traffic Assignment
- Transit Network
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Bellmann, "On a routing problem", Quaterly of Applied Mathematics 16 (1958) 87–90.
G.B. Dantzig, Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).
G. Gallo and S. Pallottino, "Shortest path methods: a unifying approach", Mathematical Programming Study 26 (1986) 38–64.
P.L. Hammer and S. Rudeanu, Boolean Methods in Operations Research (Springer-Verlag, NY, 1968).
S. Nguyen and S. Pallottino, "Assegnamento dei passeggeri ad un sistema di linee urbane: determinazione degli ipercamini minimi", Quaderno IAC 6, 1985.
S. Nguyen and S. Pallottino, "Equilibrium traffic assignment for large scale transit networks", Quaderno IAC 14, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag
About this paper
Cite this paper
Nguyen, S., Pallottino, S. (1989). Hyperpaths and shortest hyperpaths. In: Simeone, B. (eds) Combinatorial Optimization. Lecture Notes in Mathematics, vol 1403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083470
Download citation
DOI: https://doi.org/10.1007/BFb0083470
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51797-9
Online ISBN: 978-3-540-46810-3
eBook Packages: Springer Book Archive
