A new branch and bound algorithm for minimax ratios problems (Q2364779)
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 new branch and bound algorithm for minimax ratios problems |
scientific article; zbMATH DE number 6751699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new branch and bound algorithm for minimax ratios problems |
scientific article; zbMATH DE number 6751699 |
Statements
A new branch and bound algorithm for minimax ratios problems (English)
0 references
25 July 2017
0 references
fractional programming
0 references
global optimization
0 references
branch and bound
0 references
adapted ratio partition
0 references
0 references
0 references
0.8874217867851257
0 references
0.8349732756614685
0 references
0.8323768973350525
0 references
