A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem-Reference-Cited by-同舟云学术

A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem

Published:2007-10 Issue:2 Volume:182 Page:597-611
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Benson Harold P.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference23 articles.

1. Parametric analysis of a multi-stage stochastic shipping problem;Almogy,1970

2. On maximizing a sum of ratios;Cambini;Journal of Information and Optimization Sciences,1989

3. Optimizing the sum of linear fractional functions and applications;Chen,2000

4. Programming, profit rates, and pricing decisions;Colantoni;Accounting Review,1969

5. Queueing-location problems on the plane;Drezner;Naval Research Logistics,1990

Cited by 51 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 branch and cut algorithm to optimize a weighted sum-of-ratios in multiobjective mixed-integer fractional programming;OR Spectrum;2024-08-12

3. An efficient branch and bound reduction algorithm for globally solving linear fractional programming problems;Chaos, Solitons & Fractals;2024-05

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

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