Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7450166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II |
scientific article; zbMATH DE number 7450166 |
Statements
Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (English)
0 references
21 December 2021
0 references
integer programming
0 references
cutting planes
0 references
branching schemes
0 references
proof complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8746562600135803
0 references
0.8010595440864563
0 references
0.796832263469696
0 references
0.7946993112564087
0 references
