The following pages link to (Q5292090):
Displaying 19 items.
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- Stochastic nuclear outages semidefinite relaxations (Q373211) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (Q431017) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (Q493691) (← links)
- Exactness criteria for SDP-relaxations of quadratic extremum problems (Q508574) (← links)
- Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
- On reduction of duality gap in quadratic knapsack problems (Q693132) (← links)
- Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- On Polyhedral Approximations of the Positive Semidefinite Cone (Q5026447) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
