A polynomial time approximation algorithm for linear fractional programs
From MaRDI portal
Recommendations
- A fully polynomial time approximation algorithm for generalized fractional programs
- A fully polynomial time approximation algorithm for linear fractional multiplicative programs
- scientific article; zbMATH DE number 7109241
- A fully polynomial time approximation algorithm for linear fractional multiplicative programming problems
- An \(\varepsilon\)-approximation algorithm for generalized fractional programs
Cited in
(13)- 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
- Solution approaches to linear fractional programming and its stochastic generalizations using second order cone approximations
- Approximation algorithms for combinatorial fractional programming problems
- On the posynomial 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 solution approach for cardinality minimization problem based on fractional programming
- Approximation of linear fractional-multiplicative problems
- scientific article; zbMATH DE number 7109241 (Why is no real title available?)
- A fully polynomial time approximation algorithm for generalized fractional programs
- Range division and linearization algorithm for a class of linear ratios optimization problems
This page was built for publication: A polynomial time approximation algorithm for linear fractional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2860406)