Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381)
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: Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems |
scientific article; zbMATH DE number 5508684
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems |
scientific article; zbMATH DE number 5508684 |
Statements
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (English)
0 references
17 February 2009
0 references
worst-case complexity
0 references
dominance conditions
0 references
set covering
0 references
Max cut
0 references
0.8845932
0 references
0.8836054
0 references
0.8785788
0 references
0.8780095
0 references
0.87758005
0 references
0.86871815
0 references
0.8677206
0 references
