Finding non-dominated bicriteria shortest pairs of disjoint simple paths (Q1025230)
From MaRDI portal
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
