Pages that link to "Item:Q1173717"
From MaRDI portal
The following pages link to Dual quadratic estimates in polynomial and Boolean programming (Q1173717):
Displayed 15 items.
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Coherent quantum LQG control (Q963775) (← links)
- The maximum clique problem (Q1318271) (← links)
- Primal-relaxed dual global optimization approach (Q1321372) (← links)
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems (Q1371947) (← links)
- A relaxation method for nonconvex quadratically constrained quadratic programs (Q1892602) (← links)
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems (Q1913605) (← links)
- Second order cone programming relaxation of nonconvex quadratic optimization problems (Q2770189) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)