Finding non-dominated bicriteria shortest pairs of disjoint simple paths (Q1025230): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.cor.2009.01.002 / rank | |||
Property / author | |||
Property / author: Q286527 / rank | |||
Property / author | |||
Property / author: Joao Carlos Namorado Climaco / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2079895178 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Disjoint paths in a network / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A quick method for finding shortest pairs of disjoint paths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5692469 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS / 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: Fibonacci heaps and their uses in improved network optimization algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A bicriterion shortest path algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3888874 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3914777 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.COR.2009.01.002 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:33, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding non-dominated bicriteria shortest pairs of disjoint simple paths |
scientific article |
Statements
Finding non-dominated bicriteria shortest pairs of disjoint simple paths (English)
0 references
18 June 2009
0 references
disjoint paths
0 references
shortest simple paths
0 references
bicriteria
0 references
ranking algorithms
0 references