A multicriteria Pareto-optimal path algorithm (Q1196025): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(92)90248-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970166004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion shortest path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in networks with vector weights / 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: Q3888874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest path problem with two objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4173309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a multicriteria shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3202146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4062203 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:01, 16 May 2024

scientific article
Language Label Description Also known as
English
A multicriteria Pareto-optimal path algorithm
scientific article

    Statements

    A multicriteria Pareto-optimal path algorithm (English)
    0 references
    0 references
    0 references
    4 January 1993
    0 references
    This paper provides an algorithm for finding Pareto-optimal paths for efficient vectors in a multicriteria network. This algorithm is a generalization of one for the bicriterion case.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    heuristics
    0 references
    Pareto-optimal paths
    0 references
    efficient vectors
    0 references
    multicriteria network
    0 references
    0 references