A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem (Q3133219): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2299898751 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1603.04597 / rank | |||
Normal rank | |||
Latest revision as of 15:20, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
