Pages that link to "Item:Q1683686"
From MaRDI portal
The following pages link to A fresh CP look at mixed-binary QPs: new formulations and relaxations (Q1683686):
Displaying 11 items.
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (Q2010370) (← links)
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
- An exact completely positive programming formulation for the discrete ordered median problem: an extended version (Q2176282) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- Exploiting partial correlations in distributionally robust optimization (Q2227536) (← links)
- Robust Quadratic Programming with Mixed-Integer Uncertainty (Q3386756) (← links)
- A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems (Q5110556) (← links)
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
