A branch and bound algorithm for solving a class of D-C programming.
Honggang XueChengxian XuPublished in: Appl. Math. Comput. (2005)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- lower bound
- finding an optimal solution
- branch and bound
- variable ordering
- randomly generated
- np hard
- integer variables
- upper bound
- upper bounding
- optimal solution
- lower bounding
- test problems
- precedence constraints
- search tree
- lagrangian relaxation
- randomly generated problems
- weighted max sat
- single machine scheduling problem
- mixed integer linear programming
- simulated annealing
- max sat
- metaheuristic
- strongly np hard
- exact solution
- exact methods
- np complete
- objective function