A combined algorithm for fractional programming
From MaRDI portal
Recommendations
- Conical partition algorithm for maximizing the sum of dc ratios
- An efficient algorithm for solving convex-convex quadratic fractional programs
- An algorithm for generalized fractional programs
- Fractional programming with convex quadratic forms and functions
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
Cited in
(15)- An approach to fractional programming via d.c. constraints problem: local search
- An Exact Method for a Discrete Quadratic Fractional Maximum Problem
- A tractable discrete fractional programming: application to constrained assortment optimization
- Dinkelbach Type Approximation Algorithms for Nonlinear Fractional Optimization Problems
- A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem
- Approximation algorithms for combinatorial fractional programming problems
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
- scientific article; zbMATH DE number 4143800 (Why is no real title available?)
- Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
- On fractional programming problem with bounded decision variables
- Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems
- An efficient algorithm for solving convex-convex quadratic fractional programs
- Conical partition algorithm for maximizing the sum of dc ratios
- scientific article; zbMATH DE number 1864569 (Why is no real title available?)
- Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios
This page was built for publication: A combined algorithm for fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959292)