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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10288-006-0004-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094229276 / rank | |||
Normal rank | |||
Revision as of 18:41, 19 March 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
