𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem

✍ Scribed by Lianbo Gao; Shashi K. Mishra; Jianming Shi


Book ID
107403320
Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
157 KB
Volume
6
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A simplicial branch and duality bound al
✍ Pei-Ping Shen; Yun-Peng Duan; Yong-Gang Pei πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 601 KB

This article presents a simplicial branch and duality bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region. To our knowledge, little progress has been made for globally solving this problem so far. The algorithm uses a branch and bound scheme wh