✦ LIBER ✦

Conical Partition Algorithm for Maximizing the Sum of dc Ratios

✍ Scribed by Yang Dai; Jianming Shi; Shouyang Wang

Book ID: 106414148
Publisher: Springer US
Year: 2005
Tongue: English
Weight: 421 KB
Volume: 31
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-004-5699-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Using conical partition to globally maxi

Using conical partition to globally maximizing the nonlinear sum of ratios

✍ Peiping Shen; Li Jin 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 300 KB

A branch-and-bound algorithm for maximiz

A branch-and-bound algorithm for maximizing the sum of several linear ratios

✍ Takahito Kuno 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 228 KB

Global Optimization Algorithm for the No

Global Optimization Algorithm for the Nonlinear Sum of Ratios Problem

✍ H. P. Benson 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 140 KB

A Revision of the Trapezoidal Branch-and

A Revision of the Trapezoidal Branch-and-Bound Algorithm for Linear Sum-of-Ratios Problems

✍ Takahito Kuno 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 498 KB

Approximation algorithms for maximizing

Approximation algorithms for maximizing the information – theoretic sum capacity of reverse link CDMA systems

✍ Arash Abadpour; Attahiru Sule Alfa; Anthony C.K. Soong 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 258 KB

A simplicial branch and duality bound al

A simplicial branch and duality bound algorithm for the sum of convex–convex ratios problem

✍ 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