The computational complexity of the relative robust shortest path problem with interval data (Q596264)
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: The computational complexity of the relative robust shortest path problem with interval data |
scientific article; zbMATH DE number 2085607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of the relative robust shortest path problem with interval data |
scientific article; zbMATH DE number 2085607 |
Statements
The computational complexity of the relative robust shortest path problem with interval data (English)
0 references
10 August 2004
0 references
Combinatorial optimization
0 references
Robust optimization
0 references
Shortest path problem
0 references
Interval data
0 references
Computational complexity
0 references
0.9425259
0 references
0.9233854
0 references
0.9167848
0 references
0.8969331
0 references
0.8961273
0 references
0.8933654
0 references
0 references
0.88687474
0 references
