On computing small variable disjunction branch-and-bound trees (Q6589747)
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 computing small variable disjunction branch-and-bound trees |
scientific article; zbMATH DE number 7898864
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On computing small variable disjunction branch-and-bound trees |
scientific article; zbMATH DE number 7898864 |
Statements
On computing small variable disjunction branch-and-bound trees (English)
0 references
20 August 2024
0 references
binary program
0 references
branch-and-bound proof
0 references
counting problem
0 references
0.9492965936660768
0 references
0.8226556181907654
0 references
0.8039659261703491
0 references
0.7562225461006165
0 references
