P systems with branch and bound for solving two hard graph problems.
Kotaro UmetsuAkihiro FujiwaraPublished in: Int. J. Netw. Comput. (2020)
Keyphrases
- branch and bound
- combinatorial optimization
- integer programming problems
- partial solutions
- branch and bound algorithm
- branch and bound procedure
- search algorithm
- randomly generated problems
- previously solved
- branch and bound method
- lower bound
- upper bound
- column generation
- depth first search
- network design problem
- branch and bound search
- search space
- optimal solution
- cutting plane
- tree decomposition
- lagrangian dual
- lagrangian heuristic
- max sat
- beam search
- tree search
- implicit enumeration
- metaheuristic
- np complete
- np hard
- neural network