An improved branch-and-bound method for maximum monomial agreement (Q2815448)
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 6599273
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved branch-and-bound method for maximum monomial agreement |
scientific article; zbMATH DE number 6599273 |
Statements
29 June 2016
0 references
branch and bound
0 references
combinatorial optimization
0 references
machine learning
0 references
0 references
An improved branch-and-bound method for maximum monomial agreement (English)
0 references
0.7256914973258972
0 references
0.7183005809783936
0 references
0.7095135450363159
0 references
0.7023793458938599
0 references
0.7023792862892151
0 references
