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...

Celý popis

Podrobná bibliografia

Vydané v:	Chaos, solitons and fractals Ročník 164; s. 112701
Hlavní autori:	Jiao, Hongwei, Ma, Junqiao
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.11.2022
Predmet:	Accelerating technic Branch-and-bound Complexity analysis Global optimization Sum of general affine ratios 90C32 Branch-and-bound Sum of general affine ratios Complexity analysis Global optimization 90C26 Accelerating technic
ISSN:	0960-0779, 1873-2887
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!