Finding shortest and dissimilar paths (Q6071084)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7771170
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding shortest and dissimilar paths |
scientific article; zbMATH DE number 7771170 |
Statements
Finding shortest and dissimilar paths (English)
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
0 references
0 references
0 references
0.9264085
0 references
0.9173437
0 references
0.91315854
0 references
0.9107621
0 references
0.9058193
0 references
0.9037174
0 references
