A FPTAS for a class of linear multiplicative problems
From MaRDI portal
Recommendations
- Approximation of linear fractional-multiplicative problems
- A full polynomial time approximation algorithm for generalized linear multiplicative problems
- A fully polynomial time approximation algorithm for convex multiplicative problems
- A fully polynomial time approximation algorithm for linear fractional multiplicative programs
- An FPTAS for minimizing the product of two non-negative linear cost functions
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- A branch-and-reduce approach to global optimization
- A finite branch-and-bound algorithm for linear multiplicative programming
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- An outcome-space finite algorithm for solving linear multiplicative programming
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Approximation algorithms for indefinite quadratic programming
- Finite algorithm for generalized linear multiplicative programming
- Global optimization of multiplicative programs
- Heuristic methods for linear multiplicative programming
- Image space analysis of generalized fractional programs
- Linear multiplicative programming
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- Quadratic programming and combinatorial minimum weight product problems
- \(NP\)-hardness of linear multiplicative programming and related problems
Cited in
(15)- On different approximation criteria for subset product problems
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
- An FPTAS for minimizing the product of two non-negative linear cost functions
- Approximation of linear fractional-multiplicative problems
- Linear decomposition approach for a class of nonconvex programming problems
- Approximation algorithm for a class of global optimization problems
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Quadratic Programming and Combinatorial Minimum Weight Product Problems
- An FPTAS for optimizing a class of low-rank functions over a polytope
- A full polynomial time approximation algorithm for generalized linear multiplicative problems
- Range division and linearization algorithm for a class of linear ratios optimization problems
- A fully polynomial time approximation algorithm for convex multiplicative problems
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
- Approximating a linear multiplicative objective in watershed management optimization
This page was built for publication: A FPTAS for a class of linear multiplicative problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q849090)
