SpeeDP

swMATH7003MaRDI QIDQ19066

No author found.

Described by source

• SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances

Related Items (3)

Using SVM to combine global heuristics for the standard quadratic problem ⋮ A nonmonotone GRASP ⋮ Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations

This page was built for software: SpeeDP