Minmax regret linear resource allocation problems. (Q1417598): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:19, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minmax regret linear resource allocation problems. |
scientific article |
Statements
Minmax regret linear resource allocation problems. (English)
0 references
5 January 2004
0 references
Polynomial algorithm
0 references
Complexity
0 references
Minmax regret optimization
0 references
