On the complexity of minmax regret linear programming (Q1887882): 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.1016/j.ejor.2003.07.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089510325 / rank | |||
Normal rank | |||
Revision as of 18:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of minmax regret linear programming |
scientific article |
Statements
On the complexity of minmax regret linear programming (English)
0 references
22 November 2004
0 references
Combinatorial optimization
0 references
Complexity theory
0 references
Uncertainty modeling
0 references
Minmax regret optimization
0 references
