A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem |
scientific article |
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
