In this report, based on the reduction and subdivision of outer space, we propose an outer space reduction-branch-bound algorithm for globally general linear sum-of-ratios fractional programs problem; based on equivalent transformation, problem decomposition and linear relaxation techniques, we propose a branch-and-bound algorithm for linear sum-of-ratios fractional programs problem with absolute values; by constructing new linear relaxation problem, and by utilizing linear relaxation problem and branch-and-bound structure construct the pruning technique, based on variable dimensional space subdivision, we propose a branch-pruning-bound algorithm for globally quadratic sum-of-ratios fractional programs problem. The global convergences of the proposed algorithms are proved, and the numerical experimental results are given to demonstrate the feasibility and efficiency of the proposed algorithms.