The following pages link to (Q4906149):
Displaying 3 items.
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- A copositive framework for analysis of hybrid Ising-classical algorithms (Q6495776) (← links)
