Pages that link to "Item:Q5084594"
From MaRDI portal
The following pages link to SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594):
Displaying 4 items.
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization (Q6665386) (← links)
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations (Q6670500) (← links)