A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem
[chapter]
2016
Lecture Notes in Computer Science
In this paper we present the application of a recently proposed, general, algorithm for combinatorial optimization to the repetitionfree longest common subsequence problem. The applied algorithm, which is labelled Construct, Merge, Solve & Adapt, generates sub-instances based on merging the solution components found in randomly constructed solutions. These sub-instances are subsequently solved by means of an exact solver. Moreover, the considered sub-instances are dynamically changing due to
doi:10.1007/978-3-319-30698-8_4
fatcat:7mw7kvl5e5fwpfykrhdjcsaqpa