An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial.
Le Thi Hoai AnMohand OuanesAhmed ZidnaPublished in: MCO (2008)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- randomly generated
- lower bounding
- upper bound
- optimal solution
- search tree
- np hard
- test problems
- mixed integer linear programming
- upper bounding
- single machine scheduling problem
- combinatorial optimization
- randomly generated problems
- lagrangian relaxation
- precedence constraints
- neural network
- evolutionary algorithm
- branch and bound method
- feasible solution
- graph theory
- multi objective
- column generation
- search space
- objective function
- strongly np hard