An efficient algorithm for solving a class of fractional programming problems
From MaRDI portal
Publication:6484437
Recommendations
- Global optimization of a class of linear fractional programming problems
- scientific article; zbMATH DE number 6179040
- A deterministic global optimization algorithm
- An \(\varepsilon\)-approximation algorithm for a class of fractional programs
- A global optimization algorithm for linear fractional programming
Cited in
(12)- A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem
- Global optimization of a class of linear fractional programming problems
- Approximation algorithms for combinatorial fractional programming problems
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- Efficient local search procedures for quadratic fractional programming problems
- A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem
- Efficient algorithms for solving nonlinear fractional programming problems
- A deterministic global optimization algorithm
- An \(\varepsilon\)-approximation algorithm for a class of fractional programs
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
- A practical nonlinear dynamic framework for solving a class of fractional programming problems
- Two-level linear relaxation method for generalized linear fractional programming
This page was built for publication: An efficient algorithm for solving a class of fractional programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6484437)
