Multi-stage branch-and-bound for maximum variance disparity clustering.
Ninad ThakoorVenkat DevarajanJean GaoPublished in: ICPR (2008)
Keyphrases
- multistage
- branch and bound
- maximum variance
- search algorithm
- branch and bound algorithm
- lower bound
- upper bound
- search space
- column generation
- optimal solution
- single stage
- combinatorial optimization
- dynamic programming
- lot sizing
- branch and bound search
- branch and bound procedure
- tree search
- branch and bound method
- lagrangian heuristic
- optimal policy
- d objects
- data points
- high dimensional data