Minmax regret combinatorial optimization problems: an algorithmic perspective (Q4917217)
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 combinatorial optimization problems: an algorithmic perspective |
scientific article; zbMATH DE number 6159179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minmax regret combinatorial optimization problems: an algorithmic perspective |
scientific article; zbMATH DE number 6159179 |
Statements
Minmax regret combinatorial optimization problems: an Algorithmic Perspective (English)
0 references
29 April 2013
0 references
minmax regret model
0 references
combinatorial optimization
0 references
exact algorithms and heuristics
0 references
robust optimization
0 references
0.8862324953079224
0 references
0.8724649548530579
0 references
0.8631911277770996
0 references
0.8342761397361755
0 references
0.8336337208747864
0 references
