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