Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) (Q882651)
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: Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) |
scientific article; zbMATH DE number 5156792
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) |
scientific article; zbMATH DE number 5156792 |
Statements
Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) (English)
0 references
24 May 2007
0 references
min-max
0 references
min-max regret
0 references
combinatorial optimization
0 references
complexity
0 references
approximation
0 references
robustness analysis
0 references
data association
0 references
0 references
0 references
