Pages that link to "Item:Q1751225"
From MaRDI portal
The following pages link to Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225):
Displaying 6 items.
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm (Q1779531) (← links)
- Fixed point theory for permissible extension type maps (Q2269955) (← links)
- On linear conic relaxation of discrete quadratic programs (Q2829559) (← links)
- Continuous Approaches to the Unconstrained Binary Quadratic Problems (Q2958833) (← links)
- A Newton-bracketing method for a simple conic optimization problem (Q4999334) (← links)