The computational complexity of the relative robust shortest path problem with interval data (Q596264): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the complexity of a class of combinatorial optimization problems with uncertainty / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Robust discrete optimization and its applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An exact algorithm for the robust shortest path problem with interval data / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Robust Optimization of Large-Scale Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The robust spanning tree problem with interval data / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the robust shortest path problem. / rank | |||
Normal rank | |||
Latest revision as of 19:42, 6 June 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
