A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem (Q3133219)
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: A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem |
scientific article |
Statements
A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem (English)
0 references
13 February 2018
0 references
cell formation
0 references
biclustering
0 references
branch and bound
0 references
upper bound
0 references
exact solution
0 references
0.9309206
0 references
0.92513984
0 references
0.9220926
0 references
0.9207225
0 references
0.91727525
0 references
0.9124309
0 references
0.9122655
0 references
