Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II |
scientific article |
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
