Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q6336516)
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: Complexity of branch-and-bound and cutting planes in mixed-integer optimization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of branch-and-bound and cutting planes in mixed-integer optimization |
scientific article |
Statements
10 March 2020
0 references
math.OC
0 references
cs.CC
0 references
