Skip to main content

Hyperpaths and shortest hyperpaths

Seminars

Part of the Lecture Notes in Mathematics book series (LNMCIME,volume 1403)

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

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Bellmann, "On a routing problem", Quaterly of Applied Mathematics 16 (1958) 87–90.

    Google Scholar 

  2. G.B. Dantzig, Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).

    Google Scholar 

  3. G. Gallo and S. Pallottino, "Shortest path methods: a unifying approach", Mathematical Programming Study 26 (1986) 38–64.

    CrossRef  Google Scholar 

  4. P.L. Hammer and S. Rudeanu, Boolean Methods in Operations Research (Springer-Verlag, NY, 1968).

    CrossRef  Google Scholar 

  5. S. Nguyen and S. Pallottino, "Assegnamento dei passeggeri ad un sistema di linee urbane: determinazione degli ipercamini minimi", Quaderno IAC 6, 1985.

    Google Scholar 

  6. S. Nguyen and S. Pallottino, "Equilibrium traffic assignment for large scale transit networks", Quaderno IAC 14, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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