An Asynchronous P System with Branch and Bound for Solving Hamiltonian Cycle Problem.
Akihiro FujiwaraKotaro UmetsuFumiya NozatoPublished in: CANDAR Workshops (2019)
Keyphrases
- branch and bound
- hamiltonian cycle
- combinatorial optimization
- traveling salesman problem
- graph coloring
- branch and bound algorithm
- integer programming problems
- max sat
- search algorithm
- branch and bound search
- lower bound
- column generation
- combinatorial problems
- search space
- upper bound
- optimal solution
- bnb adopt
- combinatorial optimization problems
- beam search
- branch and bound procedure
- phase transition
- tree search
- simulated annealing
- optimization problems
- metaheuristic
- search strategies
- linear programming
- vehicle routing problem
- orders of magnitude