A branch-and-cut approach to the repetition-free longest common subsequence problem
scientific article; zbMATH DE number 6033965