An approximation algorithm for interval data minmax regret combinatorial optimization problems (Q1045926): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:02, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for interval data minmax regret combinatorial optimization problems |
scientific article |
Statements
An approximation algorithm for interval data minmax regret combinatorial optimization problems (English)
0 references
18 December 2009
0 references
robust optimization
0 references
maximal regret
0 references
approximation algorithms
0 references
combinatorial optimization
0 references
