Pages that link to "Item:Q3004990"
From MaRDI portal
The following pages link to Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs (Q3004990):
Displaying 15 items.
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- A fresh CP look at mixed-binary QPs: new formulations and relaxations (Q1683686) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225) (← links)
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
- Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
- The \(Q\) method for second order cone programming (Q2459387) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- On linear conic relaxation of discrete quadratic programs (Q2829559) (← links)
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
- Bounds for Random Binary Quadratic Programs (Q4609468) (← links)
- Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems (Q5740224) (← links)
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)
