Pages that link to "Item:Q1925791"

The following pages link to SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791):

Displaying 11 items.

• SpeeDP (Q19066) (← links)
• A nonmonotone GRASP (Q340011) (← links)
• An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
• SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
• \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM (Q2231040) (← links)
• Using SVM to combine global heuristics for the standard quadratic problem (Q2629704) (← links)
• Computational Approaches to Max-Cut (Q2802547) (← links)
• Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations (Q2826815) (← links)
• (Q3093399) (← links)
• A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)
• Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B (Q6155645) (← links)