On the complexity of selecting disjunctions in integer programming (Q3083283)
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: On the complexity of selecting disjunctions in integer programming |
scientific article; zbMATH DE number 5868691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of selecting disjunctions in integer programming |
scientific article; zbMATH DE number 5868691 |
Statements
On the Complexity of Selecting Disjunctions in Integer Programming (English)
0 references
21 March 2011
0 references
complexity
0 references
disjunctions
0 references
general branching
0 references
split inequalities
0 references
integer programming
0 references
0.7854301929473877
0 references
0.7711331248283386
0 references
0.7597880363464355
0 references
0.7596237063407898
0 references
0.75228351354599
0 references
