Pages that link to "Item:Q1925791"
From MaRDI portal
The following pages link to SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791):
Displaying 6 items.
- SpeeDP (Q19066) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← 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)
