Semidefinite programming in combinatorial and polynomial optimization
From MaRDI portal
Recommendations
- Semidefinite programming in combinatorial optimization
- Semidefinite programming and combinatorial optimization
- Semidefinite programming and combinatorial optimization
- scientific article; zbMATH DE number 1944141
- Polyhedral and semidefinite programming methods in combinatorial optimization
- Semidefinite programming
- scientific article; zbMATH DE number 1047682
- Semidefinite programming
- Semidefinite Programming
- Semidefinite programming and integer programming
Cited in
(16)- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Semidefinite programming in combinatorial optimization
- Complementarity and nondegeneracy in semidefinite programming
- New approaches for optimizing over the semimetric polytope
- A new way of using semidefinite programming with applications to linear equations mod p
- A gentle introduction to semi-definite programming
- Computation with polynomial equations and inequalities arising in combinatorial optimization
- scientific article; zbMATH DE number 1944141 (Why is no real title available?)
- Optimization over polynomials: selected topics
- scientific article; zbMATH DE number 7342542 (Why is no real title available?)
- Semidefinite programming relaxations for linear semi-infinite polynomial programming
- Semidefinite programming and integer programming
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
- Semidefinite programming and combinatorial optimization
- Semidefinite programming and its applications to NP problems
- Polyhedral and semidefinite programming methods in combinatorial optimization
This page was built for publication: Semidefinite programming in combinatorial and polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889301)