A two-criterion lexicographic algorithm for finding all shortest paths in networks (Q2263347)

From MaRDI portal
Revision as of 22:31, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A two-criterion lexicographic algorithm for finding all shortest paths in networks
scientific article

    Statements

    A two-criterion lexicographic algorithm for finding all shortest paths in networks (English)
    0 references
    0 references
    18 March 2015
    0 references
    multicriteria problem of finding shortest paths
    0 references
    algorithm
    0 references
    computational complexity
    0 references

    Identifiers