Minmax regret linear resource allocation problems. (Q1417598)
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: Minmax regret linear resource allocation problems. |
scientific article; zbMATH DE number 2021248
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minmax regret linear resource allocation problems. |
scientific article; zbMATH DE number 2021248 |
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