A branch-and-bound algorithm for solving max-k-cut problem.
Cheng LuZhibin DengPublished in: J. Glob. Optim. (2021)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- lower bound
- branch and bound
- finding an optimal solution
- variable ordering
- upper bound
- integer variables
- randomly generated
- np hard
- test problems
- precedence constraints
- optimal solution
- lower bounding
- randomly generated problems
- upper bounding
- lagrangian relaxation
- search tree
- weighted max sat
- traveling salesman problem
- single machine scheduling problem
- mixed integer linear programming
- max sat
- exact methods
- branch and bound method
- search algorithm
- metaheuristic
- simulated annealing
- multi step
- mathematical programming