An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem (Q691453)
From MaRDI portal
!
WARNING
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 6111709
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem |
scientific article; zbMATH DE number 6111709 |
Statements
An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem (English)
0 references
30 November 2012
0 references
sum-of-linear (nonlinear)-ratios problem
0 references
\({\mathcal{NP}}\)-hard
0 references
branch-and-bound approach
0 references
0 references
0 references
0.91494155
0 references
0.9142194
0 references
0.9141351
0 references
0.9126832
0 references
0.9100392
0 references
0.90670025
0 references
0.90370697
0 references
