A Learning based Branch and Bound for Maximum Common Subgraph Problems.
Yanli LiuChu-Min LiHua JiangKun HePublished in: CoRR (2019)
Keyphrases
- branch and bound
- branch and bound algorithm
- optimal solution
- randomly generated problems
- search algorithm
- lower bound
- branch and bound procedure
- branch and bound method
- np complete
- partial solutions
- combinatorial optimization
- application domains
- object recognition
- reinforcement learning
- bayesian networks
- tree search
- branch and bound search
- search space