The computational complexity of the relative robust shortest path problem with interval data (Q596264): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:49, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of the relative robust shortest path problem with interval data |
scientific article |
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
