SpeeDP

MaRDI QIDQ19066swMATHFDO

Official website http://www.dis.uniroma1.it/~palagi/papers10/SpeeDP.pdf

Described by source

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

Cited in

(5)

• Algorithm 815
• Algorithm 769
• 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