Polynomial time weak approximation algorithms for quadratic programming
From MaRDI portal
Cited in
(6)- On approximation algorithms for concave mixed-integer quadratic programming
- Maximization of a PSD quadratic form and factorization
- An approximation algorithm for indefinite mixed integer quadratic programming
- A note on the complexity of \(L _{p }\) minimization
- The mixed integer trust region problem
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
This page was built for publication: Polynomial time weak approximation algorithms for quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2743981)
