SpeeDP

swMATH7003MaRDI QIDQ19066FDOQ19066

Author name not available (Why is that?)

Described by source

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

Cited In (3)

• A nonmonotone GRASP
• Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
• Using SVM to combine global heuristics for the standard quadratic problem

This page was built for software: SpeeDP