An Asynchronous P System Using Branch and Bound for Minimum Graph Coloring.
Kotaro UmetsuAkihiro FujiwaraPublished in: CANDAR Workshops (2019)
Keyphrases
- branch and bound
- graph coloring
- max sat
- branch and bound algorithm
- combinatorial problems
- combinatorial optimization
- lower bound
- search algorithm
- upper bound
- column generation
- search space
- optimal solution
- job shop scheduling
- phase transition
- branch and bound procedure
- beam search
- tree search
- search strategies
- metaheuristic
- constraint satisfaction problems
- traveling salesman problem
- search tree
- combinatorial optimization problems
- simulated annealing
- satisfiability problem
- linear programming
- scheduling problem
- tabu search
- sat solvers
- sat problem
- optimization problems
- objective function