Cutting plane algorithms for \(0-1\) programming based on cardinality cuts (Q976440)
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: Cutting plane algorithms for 0-1 programming based on cardinality cuts |
scientific article; zbMATH DE number 5720395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cutting plane algorithms for \(0-1\) programming based on cardinality cuts |
scientific article; zbMATH DE number 5720395 |
Statements
Cutting plane algorithms for \(0-1\) programming based on cardinality cuts (English)
0 references
11 June 2010
0 references
\(0-1\) integer programming
0 references
valid inequalities
0 references
cutting planes
0 references
0.8207365274429321
0 references
0.8069391846656799
0 references
0.7928902506828308
0 references
