Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression.
Réal André CarbonneauGilles CaporossiPierre HansenPublished in: Comput. Oper. Res. (2012)
Keyphrases
- globally optimal
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- np hard
- graph cuts
- optimal solution
- locally optimal
- lower bounding
- randomly generated problems
- surface segmentation
- optimal decisions
- precedence constraints
- combinatorial optimization
- mixed integer linear programming
- upper bounding
- lagrangian relaxation
- search algorithm
- single machine scheduling problem
- max sat
- variable ordering
- window search
- global optimality
- worst case
- branch and bound method
- evolutionary algorithm
- convex relaxation
- maximum clique
- integer variables