Exact algorithms for the repetition-bounded longest common subsequence problem.
Yuichi AsahiroJesper JanssonGuohui LinEiji MiyanoHirotaka OnoTadatoshi UtashimaPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- exact algorithms
- beam search
- knapsack problem
- branch and bound
- approximation algorithms
- max sat
- exact solution
- vehicle routing problem with time windows
- combinatorial optimization
- benders decomposition
- computational problems
- search algorithm
- combinatorial optimization problems
- heuristic search
- heuristic methods
- combinatorial problems
- column generation
- optimization problems
- search methods
- search problems
- machine learning
- genetic algorithm
- search space
- np hard
- dynamic programming
- hill climbing
- branch and bound algorithm
- ranking functions
- traveling salesman problem