Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) (Q882651): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10288-006-0004-6 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10288-006-0004-6 / rank | |||
Normal rank | |||
Latest revision as of 06:55, 10 December 2024
scientific article
| 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 |
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
