A comparison of heuristic best-first algorithms for bicriterion shortest path problems (Q439323): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An empirical investigation of some bicriterion shortest path algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion approach for routing problems in multimedia networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized best-first search strategies and the optimality of A* / 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: An aggregate label setting policy for the multi-objective shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective A <sup>*</sup> search with consistent heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parametric approach to solving bicriterion shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cardinality of the Pareto set in bicriteria shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of solution strategies for biobjective shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective A* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3202146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multicriteria Pareto-optimal path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of labeling techniques for finding shortest path trees / rank
 
Normal rank

Latest revision as of 14:12, 5 July 2024

scientific article
Language Label Description Also known as
English
A comparison of heuristic best-first algorithms for bicriterion shortest path problems
scientific article

    Statements

    A comparison of heuristic best-first algorithms for bicriterion shortest path problems (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    search theory
    0 references
    combinatorial optimization
    0 references
    multiobjective shortest path problem
    0 references
    best-first search
    0 references
    heuristic search
    0 references
    artificial intelligence
    0 references
    0 references