Solving min-max shortest-path problems on a network (Q4018281)
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: Solving min-max shortest-path problems on a network |
scientific article; zbMATH DE number 89998
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving min-max shortest-path problems on a network |
scientific article; zbMATH DE number 89998 |
Statements
16 January 1993
0 references
routing
0 references
multiobjective shortest-path problems
0 references
label-correcting procedure
0 references
pruning
0 references
0 references
Solving min-max shortest-path problems on a network (English)
0 references
0.7970187664031982
0 references
0.7970184087753296
0 references
0.7946102619171143
0 references
0.7940382361412048
0 references
