Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 21:49, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Min-max and min-max regret versions of combinatorial optimization problems: A survey |
scientific article |
Statements
Min-max and min-max regret versions of combinatorial optimization problems: A survey (English)
0 references
30 April 2009
0 references
min-max
0 references
min-max regret
0 references
combinatorial optimization
0 references
complexity
0 references
approximation
0 references
robustness
0 references