Completed
Branching Strategy
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Global Optimization for Cardinality-Constrained Minimum Sum-of-Squares Clustering via Semidefinite Programming
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Linear Programming Problem
- 3 Motivation
- 4 Background Knowledge
- 5 State of the art
- 6 Semidefinite programming
- 7 Block diagonal matrix
- 8 Branch bound algorithm
- 9 Cardinality constraint formulation
- 10 Cardinality constraint reformulation
- 11 Cardinality constraint relaxation
- 12 Postprocessing
- 13 Inequalities
- 14 Branching Strategy
- 15 Linear Constraints
- 16 Heuristics
- 17 Initial Set of Centers
- 18 Numerical Results
- 19 Instances
- 20 Results
- 21 Branching bound
- 22 Conclusion
