A FPTAS for a class of linear multiplicative problems
From MaRDI portal
Publication:849090
DOI10.1007/s10589-007-9156-3zbMath1184.90165MaRDI QIDQ849090
Marco Locatelli, Daniele Depetrini
Publication date: 24 February 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9156-3
90C30: Nonlinear programming
Related Items
Approximation of linear fractional-multiplicative problems, Approximation algorithm for a class of global optimization problems
Cites Work
- Unnamed Item
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Approximation algorithms for indefinite quadratic programming
- An outcome-space finite algorithm for solving linear multiplicative programming
- Quadratic programming and combinatorial minimum weight product problems
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Linear multiplicative programming
- Image space analysis of generalized fractional programs
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Global optimization of multiplicative programs
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- Heuristic methods for linear multiplicative programming
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Finite algorithm for generalized linear multiplicative programming
- A branch-and-reduce approach to global optimization
- \(NP\)-hardness of linear multiplicative programming and related problems
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- A finite branch-and-bound algorithm for linear multiplicative programming
