The shortest path problem with two objective functions (Q1077332)
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 3956840
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The shortest path problem with two objective functions |
scientific article; zbMATH DE number 3956840 |
Statements
The shortest path problem with two objective functions (English)
0 references
1986
0 references
two objective functions
0 references
shortest path in a network
0 references
nondominated paths
0 references
quasiconvex utility functions
0 references
branch and bound
0 references
0.9102989
0 references
0.8889518
0 references
0.8878321
0 references
0.8851718
0 references
0.8847563
0 references
0.8832089
0 references
0.8799904
0 references
0.8756903
0 references
