A branch-and-bound algorithm for the minimum radius $k$-enclosing ball problem.
Marta CavaleiroFarid AlizadehPublished in: CoRR (2017)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- randomly generated
- upper bound
- lower bounding
- optimal solution
- test problems
- np hard
- precedence constraints
- combinatorial optimization
- search tree
- mixed integer linear programming
- branch and bound method
- randomly generated problems
- upper bounding
- finding an optimal solution
- variable ordering
- single machine scheduling problem
- max sat
- maximum clique
- neural network
- integer variables
- search space