A practicable branch and bound algorithm for sum of linear ratios problem

From MaRDI portal
Publication:319186

DOI10.1016/j.ejor.2015.01.039zbMath1346.90773OpenAlexW2061039541MaRDI QIDQ319186

San-Yang Liu, Hong-Wei Jiao

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.01.039




Related Items (33)

Regional division and reduction algorithm for minimizing the sum of linear fractional functionsA new branch and bound algorithm for minimax ratios problemsSolving generalized polynomial problem by using new affine relaxed techniqueA reduced space branch and bound algorithm for a class of sum of ratios problemsOutcome space range reduction method for global optimization of sum of affine ratios problemAn efficient algorithm for computing a class of multiplicative optimization problemA geometric branch-and-bound algorithm for the service bundle design problemA solution approach for cardinality minimization problem based on fractional programmingTwo-level linear relaxation method for generalized linear fractional programmingAn Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios ProblemAn efficient algorithm and complexity result for solving the sum of general affine ratios problemA spatial branch and bound algorithm for solving the sum of linear ratios optimization problemA new deterministic global computing algorithm for solving a kind of linear fractional programmingA potential practical algorithm for minimizing the sum of affine fractional functionsA practicable contraction approach for the sum of the generalized polynomial ratios problemAn efficient algorithm for globally solving generalized linear multiplicative programmingEffective algorithm and computational complexity for solving sum of linear ratios problemRange division and linearization algorithm for a class of linear ratios optimization problemsAn effective computational algorithm for the global solution of a class of linear fractional programmingAn outcome space algorithm for minimizing a class of linear ratio optimization problemsAn efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotientsRange division and compression algorithm for quadratically constrained sum of quadratic ratiosOptimal spares allocation to an exchangeable-item repair system with tolerable waitIntegrated data envelopment analysis: linear vs. nonlinear modelLinear decomposition approach for a class of nonconvex programming problemsDuality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problemA conic relaxation model for searching for the global optimum of network data envelopment analysisEffective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraintsAn effective algorithm for globally solving sum of linear ratios problemsInner approximation algorithm for generalized linear multiplicative programming problemsAn effective global optimization algorithm for quadratic programs with quadratic constraintsSolution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone ApproximationsAn outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems


Uses Software


Cites Work


This page was built for publication: A practicable branch and bound algorithm for sum of linear ratios problem