A branch-and-bound algorithm to globally solve the sum of several linear ratios-Reference-Cited by-同舟云学术

A branch-and-bound algorithm to globally solve the sum of several linear ratios

Published:2005-09 Issue:1 Volume:168 Page:89-101
ISSN:0096-3003
Container-title:Applied Mathematics and Computation
language:en
Short-container-title:Applied Mathematics and Computation

Author:

Yanjun Wang,Peiping Shen,Zhian Liang

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Mathematics

Reference9 articles.

1. Programming with linear fractional functions;Charnes;Naval Research Logistics Quarterly,1962

2. Parametric simplex algorithms for solving a special class of nonconvex minimization problems;Konno;Journal of Global Optimization,1991

3. A branch-and-bound algorithm for maximizing the sum of several linear ratios;Kuno;Journal of Global Optimization,2002

4. H. Konno, H. Yamashita, Minimization of the sum and the product of several linear fractional functions, Tokyo Institute of Technology, Technical Report, 1997.

Cited by 29 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications;Journal of Computational and Applied Mathematics;2024-12

2. A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems;Journal of Global Optimization;2024-02-15

3. An Outer Space Approach to Tackle Generalized Affine Fractional Program Problems;Journal of Optimization Theory and Applications;2024-01-16

4. Sub-6 GHz V2X-assisted MmWave optimal scheduling for vehicular networks;Vehicular Communications;2023-06

5. An accelerating outer space algorithm for globally solving generalized linear multiplicative problems;Numerical Algorithms;2023-04-20