Finding shortest and dissimilar paths (Q6071084): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3202476543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding dissimilar paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach to the overnight security service problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria path and tree problems: discussion on exact algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective programming and planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed capacitated arc routing problem with non-overlapping routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding dissimilar Pareto-optimal paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and annotated bibliography of multiobjective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3523238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling of Transport Risk for Hazardous Materials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bi-objective approach to discrete cost-bottleneck location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiple shortest path problem with path deconfliction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a relaxed maximally disjoint path pair problem: a bicriteria approach / 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: The \(k\)-dissimilar vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi‐objective combinatorial optimization problems: A survey / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:46, 19 August 2024

scientific article; zbMATH DE number 7771170
Language Label Description Also known as
English
Finding shortest and dissimilar paths
scientific article; zbMATH DE number 7771170

    Statements

    Finding shortest and dissimilar paths (English)
    0 references
    0 references
    0 references
    0 references
    27 November 2023
    0 references
    biobjective optimization
    0 references
    cost
    0 references
    dissimilarity
    0 references
    integer programming formulations
    0 references
    \(K\) alternative paths
    0 references

    Identifiers