Shortest paths in networks with vector weights (Q795755): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4083324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Appraisal of Some Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Shortest-Path Algorithms: A Comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-Route Methods: 1. Reaching, Pruning, and Buckets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shortest Route Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper efficiency and the theory of vector maximization / rank
 
Normal rank

Latest revision as of 13:18, 14 June 2024

scientific article
Language Label Description Also known as
English
Shortest paths in networks with vector weights
scientific article

    Statements

    Shortest paths in networks with vector weights (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    For a directed network in which vector weights are assigned to arcs, the Pareto analog to the shortest path problem is analyzed. An algorithm is presented for obtaining all Pareto shortest paths from a specified node to every other node.
    0 references
    0 references
    directed network
    0 references
    vector weights
    0 references
    Pareto shortest paths
    0 references