Approximation algorithm for a class of global optimization problems
From MaRDI portal
Publication:1937958
DOI10.1007/s10898-011-9813-zzbMath1263.90066OpenAlexW1988893808MaRDI QIDQ1937958
Publication date: 1 February 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9813-z
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Solving a class of generalized fractional programming problems using the feasibility of linear programs ⋮ (Global) optimization: historical notes and recent developments ⋮ Range division and linearization algorithm for a class of linear ratios optimization problems ⋮ An effective branch and bound algorithm for minimax linear fractional programming
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation of linear fractional-multiplicative problems
- Approximation algorithms for indefinite quadratic programming
- A FPTAS for a class of linear multiplicative problems
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- Quadratic programming and combinatorial minimum weight product problems
- Approximating quadratic programming with bound and quadratic constraints
- Approximation and complexity in numerical optimization. Continuous and discrete problems. Conference, Univ. of Florida, Orlando, FL, USA, February 28 - March 2, 1999
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Some optimal inapproximability results
- On Nonlinear Fractional Programming
This page was built for publication: Approximation algorithm for a class of global optimization problems
