Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem.
Yuichi AsahiroJesper JanssonGuohui LinEiji MiyanoHirotaka OnoTadatoshi UtashimaPublished in: COCOA (2019)
Keyphrases
- exact algorithms
- beam search
- knapsack problem
- approximation algorithms
- exact solution
- vehicle routing problem with time windows
- branch and bound
- heuristic methods
- computational problems
- combinatorial optimization
- combinatorial optimization problems
- max sat
- benders decomposition
- heuristic search
- search methods
- search algorithm
- neural network
- branch and bound algorithm
- combinatorial problems
- ranking functions
- np hard
- optimal solution
- reinforcement learning
- column generation
- metaheuristic
- constraint satisfaction problems
- information retrieval systems