A fully polynomial time approximation algorithm for generalized fractional programs
From MaRDI portal
Recommendations
- A polynomial time approximation algorithm for linear fractional programs
- An \(\varepsilon\)-approximation algorithm for generalized fractional programs
- A fully polynomial time approximation algorithm for generalized linear multiplicative programming
- An \(\varepsilon\)-approximation algorithm for a class of fractional programs
- A fully polynomial time approximation algorithm for linear fractional multiplicative programs
Cited in
(11)- Iterative algorithm of generalized fractional programming problems with polynomial constraints
- An \(\varepsilon\)-approximation algorithm for generalized fractional programs
- A fully polynomial time approximation algorithm for linear fractional multiplicative programs
- A fully polynomial time approximation algorithm for linear fractional multiplicative programming problems
- A polynomial time approximation algorithm for linear fractional programs
- An -approximation algorithm for generalized fractional programming problems
- Approximation algorithms for combinatorial fractional programming problems
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- An \(\varepsilon\)-approximation algorithm for a class of fractional programs
- A fully polynomial time approximation algorithm for generalized linear multiplicative programming
- Global minimization for generalized polynomial fractional program
This page was built for publication: A fully polynomial time approximation algorithm for generalized fractional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3462697)