An -approximation algorithm for generalized fractional programming problems
From MaRDI portal
An \(\varepsilon\)-approximation algorithm for generalized fractional programming problems
Recommendations
- An \(\varepsilon\)-approximation algorithm for generalized fractional programs
- An -approximation algorithm for a class of fractional programs
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- A fully polynomial time approximation algorithm for generalized fractional programs
- A fully polynomial time approximation algorithm for linear fractional multiplicative programs
Cites work
- A fully polynomial time approximation algorithm for generalized fractional programs
- A unified monotonic approach to generalized linear fractional programming
- An FPTAS for optimizing a class of low-rank functions over a polytope
- Approximation of linear fractional-multiplicative problems
- Fractional programming
- Generalized linear multiplicative and fractional programming
- Global optimization for generalized linear multiplicative programming using convex relaxation
- Global optimization of multiplicative programs
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
Cited in
(5)- Convergence of interval-type algorithms for generalized fractional programming
- Approximation algorithm for a class of global optimization problems
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- An \(\varepsilon\)-approximation algorithm for generalized fractional programs
- An -approximation algorithm for a class of fractional programs
This page was built for publication: An \(\varepsilon\)-approximation algorithm for generalized fractional programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5038031)
