A computational study of conflict graphs and aggressive cut separation in integer programming (Q324843)
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: A computational study of conflict graphs and aggressive cut separation in integer programming |
scientific article; zbMATH DE number 6639918
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational study of conflict graphs and aggressive cut separation in integer programming |
scientific article; zbMATH DE number 6639918 |
Statements
A computational study of conflict graphs and aggressive cut separation in integer programming (English)
0 references
17 October 2016
0 references
conflict graphs
0 references
integer programming
0 references
cutting planes
0 references
cliques
0 references
odd-holes
0 references
0.8253428936004639
0 references
0.8060491681098938
0 references
0.7334447503089905
0 references
0.7263848185539246
0 references
0.7228702306747437
0 references
