This article presents a practicable algorithm for globally solving sum of linear ratios problem
(SLR). The algorithm works by globally solving a bilinear programming problem (EQ) that is …

In this paper, a global optimization algorithm is proposed for solving sum of generalized
polynomial ratios problem (P) which arises in various practical problems. Due to its intrinsic …

The quadratic sum-of-ratios fractional program problem has a broad range of applications in
practical problems. This article will present an efficient branch-and-bound algorithm for …

This paper lists in alphabetical order by the name of the first author, 745 papers dealing with
fractional programming and its applications. This covers mainly the period 2005-2012 but it …

In this paper, we present an algorithm for solving the sum-of-linear-ratios problem based on
a linear relaxation of the objective function. Though there already exist linear relaxation …

This paper tries to minimize the sum of a linear and a linear fractional function over a closed
convex set defined by some linear and conic quadratic constraints. At first, we represent …

In this paper, we study the problem of maximizing the sum of a concave–convex quadratic
fractional function on a non-empty, bounded, convex quadratic feasible set, which is called …

For globally solving sum of linear ratios problem (SLRP), this paper presents a new branch-
and-bound method. In this method, a new linear relaxation technique is proposed firstly; …

The increasing complexity of large‐scale real‐world programs necessitates the automation
of software testing. As a basic problem in software testing, the automation of path‐wise test …

Path-oriented test case generation is in essence a constraint satisfaction problem (CSP)
solved by search strategies, among which backtracking algorithms are widely used. In this …