A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem |
scientific article; zbMATH DE number 6650851
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem |
scientific article; zbMATH DE number 6650851 |
Statements
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (English)
0 references
10 November 2016
0 references
biobjective path problems
0 references
supported efficient paths
0 references
label-setting algorithm
0 references
0 references
0 references
0.8694803714752197
0 references
0.8162829279899597
0 references
0.8138195276260376
0 references
0.7952637672424316
0 references
0.7821183204650879
0 references
