Skip to main content
SpringerLink
Log in

Generalization of a multicriteria shortest path problem in an oriented graph

  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

A partial order relation is introduced on the set of all paths. An algorithm for determination of the shortest paths is considered providing an additional condition on the partial order is assumed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms (MIT & McGraw-Hill, 1990; Izd-vo MCCME, Moscow, 1999).

  2. P. Vincke, “Problemes Multicriteres,” Cahiers du Centre d’Etudes de Recherche Operationelle, 16, 425 (1974).

    MATH  MathSciNet  Google Scholar 

  3. P. Hansen, “Bicriterion Path Problems,” in: Multiple Criteria Decision Making: Theory and Application, Ed. by G. Fandel and T. Gal, Lectures Notes in Economics and Mathematical Systems, 177, (Springer, Heidelberg, 1979), pp. 109–127.

    Google Scholar 

  4. E. Q. Martins, “On a Multicriteria Shortest Path Problem,” Eur. J. Oper. Res. 16, 236 (1984).

    Article  MATH  MathSciNet  Google Scholar 

  5. J. Brumbaugh-Smith and D. Shier, “An Empirical Investigation of Some Bicriterion Shortest Path Algorithms,” Eur. J. Oper. Res. 43(2), 216 (1989).

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Mote, I. Murthy, and D. L. Olson, “A Parametric Approach to Solving Bicriterion Shortest Path Problems,” Eur. J. Oper. Res. 53, 81 (1991).

    Article  MATH  Google Scholar 

  7. A. J. Skriver and K. A. Andersen, “A Label Correcting Approach for Solving Bicriterion Shortest Path Problems,” Comput. and Oper. Res. 27(6), 507 (2000).

    Article  MATH  MathSciNet  Google Scholar 

  8. M. V. Krasnov, “Multicriteria Shortest Paths Problem for all Pairs of Graph Vertices,” Sovremennye Problemy Matem. i Inform. No. 3, 62 (2000) [in Russian].

  9. E. V. Pankratiev, A. M. Chepovskiy, E. A. Cherepanov, and S. V. Chernyshev, “Algorithms and Methods for Solving Scheduling Problems and Other Extremum Problems on Large-Scale Graphs,” Fundamental’naya i Prikladnaya Matem. 9(1), 235 (2003) [J. Math. Sci. 128 (6), 3487 (2005)].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mechanics and Mathematics, Moscow State University, Leninskie Gory, Moscow, 119991, Russia

    S. V. Chernyshev

Authors
  1. S. V. Chernyshev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © S.V. Chernyshev, 2007, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2007, Vol. 62, No. 6, pp. 3–8.

About this article

Cite this article

Chernyshev, S.V. Generalization of a multicriteria shortest path problem in an oriented graph. Moscow Univ. Math. Bull. 62, 213–218 (2007). https://doi.org/10.3103/S0027132207060010

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0027132207060010

Keywords

Search

Navigation