Improving local search for the weighted sum coloring problem using the branch-and-bound algorithm.
Dangdang NiuBin LiuHongming ZhangMinghao YinPublished in: Knowl. Based Syst. (2022)
Keyphrases
- weighted sum
- branch and bound algorithm
- combinatorial optimization
- optimal solution
- lower bound
- branch and bound
- objective function
- np hard
- upper bound
- search algorithm
- lower bounding
- precedence constraints
- linear combination
- search space
- single machine scheduling problem
- randomly generated problems
- simulated annealing
- upper bounding
- metaheuristic
- tabu search
- genetic algorithm
- traveling salesman problem
- lagrangian relaxation
- mixed integer linear programming
- linear program
- neural network
- max sat
- scheduling problem
- multi objective
- efficient solutions
- input image
- cost function
- weight function