Robust least-square-baseline finding using a branch and bound algorithm.
Thomas M. BreuelPublished in: Document Recognition and Retrieval (2002)
Keyphrases
- branch and bound algorithm
- least squares
- lower bound
- branch and bound
- optimal solution
- maximum clique
- upper bound
- randomly generated
- search tree
- test problems
- combinatorial optimization
- np hard
- lower bounding
- precedence constraints
- randomly generated problems
- upper bounding
- lagrangian relaxation
- mixed integer linear programming
- single machine scheduling problem
- finding an optimal solution
- variable ordering
- max sat
- column generation
- neural network
- branch and bound method
- cost function
- scheduling problem
- optimization problems