Cardinality constrained combinatorial optimization: complexity and polyhedra (Q429646)
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: Cardinality constrained combinatorial optimization: complexity and polyhedra |
scientific article; zbMATH DE number 6048230
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cardinality constrained combinatorial optimization: complexity and polyhedra |
scientific article; zbMATH DE number 6048230 |
Statements
Cardinality constrained combinatorial optimization: complexity and polyhedra (English)
0 references
20 June 2012
0 references
cardinality constraints
0 references
valid inequalities
0 references
matroidal relaxation
0 references
cut polytope
0 references
0 references
0.8795726299285889
0 references
0.8676020503044128
0 references
0.8003123998641968
0 references
0.796485960483551
0 references
0.7852598428726196
0 references
