Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems |
scientific article |
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
