A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem.
Jianrong ZhouKun HeJiongzhi ZhengChu-Min LiYanli LiuPublished in: IJCAI (2022)
Keyphrases
- branch and bound algorithm
- np hard
- lower bound
- branch and bound
- maximum clique
- upper bound
- optimal solution
- search tree
- test problems
- precedence constraints
- mixed integer linear programming
- lower bounding
- combinatorial optimization
- single machine scheduling problem
- search space
- upper bounding
- randomly generated problems
- max sat
- graph mining
- search algorithm
- variable ordering
- lagrangian relaxation
- branch and bound method
- objective function
- column generation
- neural network
- finding an optimal solution