TY - GEN
T1 - A numerical study on B&B algorithms for solving sum-of-ratios problem
AU - Gao, Lianbo
AU - Shi, Jianming
PY - 2010
Y1 - 2010
N2 - The purpose of this paper is threefold; (1) Offer a synopsis of algorithmic review and to make a comparison between two branch-and-bound approaches for solving the sum-of-ratios problem; (2) Modify an promising algorithm for nonlinear sum-of-ratios problem; (3) Study the efficiency of the algorithms via numerical experiments.
AB - The purpose of this paper is threefold; (1) Offer a synopsis of algorithmic review and to make a comparison between two branch-and-bound approaches for solving the sum-of-ratios problem; (2) Modify an promising algorithm for nonlinear sum-of-ratios problem; (3) Study the efficiency of the algorithms via numerical experiments.
KW - Sum-of-ratios problem
KW - branch-and-bound approach
KW - fractional programming
UR - http://www.scopus.com/inward/record.url?scp=77954571454&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-13577-4_31
DO - 10.1007/978-3-642-13577-4_31
M3 - Conference contribution
AN - SCOPUS:77954571454
SN - 3642135765
SN - 9783642135767
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 356
EP - 362
BT - Advances in Computer Science and Information Technology - AST/UCMA/ISA/ACN 2010 Conferences, Joint Proceedings
T2 - 2nd International Conference on Advanced Science and Technology
Y2 - 23 June 2010 through 25 June 2010
ER -