An efficient algorithm and complexity result for solving the sum of general affine ratios problem
In this paper, with the unique hypothesis that the denominator is not equal to 0, an efficient outer space rectangle branch-and-bound algorithm is presented to globally solve the sum of general affine ratios problem. By using equivalent transformation and the characteristics of general single ratio...
Saved in:
| Published in: | Chaos, solitons and fractals Vol. 164; p. 112701 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.11.2022
|
| Subjects: | |
| ISSN: | 0960-0779, 1873-2887 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!