An Effective Branch-and-Bound Algorithm to Solve the k-Longest Common Subsequence Problem.
Gaofeng HuangAndrew LimPublished in: ECAI (2004)
Keyphrases
- branch and bound algorithm
- lower bound
- mixed integer linear programming
- branch and bound
- beam search
- finding an optimal solution
- np hard
- upper bounding
- upper bound
- combinatorial optimization
- optimal solution
- precedence constraints
- randomly generated problems
- weighted max sat
- max sat
- scheduling problem
- lower bounding
- strongly np hard
- search algorithm
- neural network
- lagrangian relaxation
- multi objective
- integer variables