An approximation algorithm for interval data minmax regret combinatorial optimization problems (Q1045926)
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: An approximation algorithm for interval data minmax regret combinatorial optimization problems |
scientific article; zbMATH DE number 5650193
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for interval data minmax regret combinatorial optimization problems |
scientific article; zbMATH DE number 5650193 |
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
0.8816176056861877
0 references
0.8664361834526062
0 references
0.857475996017456
0 references
0.8474599719047546
0 references
