On the complexity of minmax regret linear programming (Q1887882): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q689131 |
||
| Property / author | |||
| Property / author: Vasilij N. Lebedev / rank | |||
Revision as of 13:22, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of minmax regret linear programming |
scientific article |
Statements
On the complexity of minmax regret linear programming (English)
0 references
22 November 2004
0 references
Combinatorial optimization
0 references
Complexity theory
0 references
Uncertainty modeling
0 references
Minmax regret optimization
0 references
