Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem.
Applied Soft Computing(2018)
摘要
•We study the use of an ILP model for the longest arc-preserving subsequence problem.•Heuristically reducing the model size leads to good results for artificial instances.•We also propose a hybrid algorithm that makes use of the ILP model.•Real world instances are best solved with the hybrid algorithm.•We empirically show the reasons for obtaining these results.
更多查看译文
关键词
Combinatorial optimization,Longest common subsequences,Integer linear programming,Heuristic,Hybrid algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络