A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
Authors:
- John Gunnar CarlssonJCJohn Gunnar Carlsson
- Jianming ShiJSJianming Shi
- 1 July 2013
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 41 (4) , 381-389
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problemOptimization Letters, 2010
- Approximation of linear fractional-multiplicative problemsMathematical Programming, 2009
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problemEuropean Journal of Operational Research, 2007
- Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with ApplicationsJournal of Combinatorial Optimization, 2005
- Determining an Optimal Penetration Among Weighted Regions in Two and Three DimensionsJournal of Combinatorial Optimization, 2001
- Solving the Sum-of-Ratios Problem by an Interior-Point MethodJournal of Global Optimization, 2001
- Minimization of the sum of three linear fractional functionsJournal of Global Optimization, 1999
- On Minimum-Area HullsAlgorithmica, 1998
- Queueing-location problems on the planeNaval Research Logistics (NRL), 1990
- Programming with linear fractional functionalsNaval Research Logistics Quarterly, 1962