Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063)
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 7658264
| 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 |
scientific article; zbMATH DE number 7658264 |
Statements
Complexity of branch-and-bound and cutting planes in mixed-integer optimization (English)
0 references
1 March 2023
0 references
complexity bounds
0 references
branch-and-bound
0 references
cutting planes
0 references
mixed integer nonlinear optimization
0 references
0 references
0 references
0 references
0.8746562600135803
0 references
0.757590115070343
0 references
0.7553632855415344
0 references
0.751407265663147
0 references
