Approximation algorithm for a mixed binary quadratically constrained quadratic programming problem
From MaRDI portal
Recommendations
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
- scientific article; zbMATH DE number 6612550
- Semidefinite approximation for mixed binary quadratically constrained quadratic programs
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
Cited in
(10)- Approximation algorithms for quadratic programming
- A rank-two feasible direction algorithm for the binary quadratic programming
- On approximation algorithms for concave mixed-integer quadratic programming
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
- Semidefinite approximation for mixed binary quadratically constrained quadratic programs
- scientific article; zbMATH DE number 6612550 (Why is no real title available?)
- On approximation algorithms for concave mixed-integer quadratic programming
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
- An approximation algorithm for indefinite mixed integer quadratic programming
This page was built for publication: Approximation algorithm for a mixed binary quadratically constrained quadratic programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941668)
