A branch-and-cut approach to the repetition-free longest common subsequence problem (Q2883608)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut approach to the repetition-free longest common subsequence problem |
scientific article |
Statements
A branch-and-cut approach to the repetition-free longest common subsequence problem (English)
0 references
13 May 2012
0 references
longest common subsequence
0 references
integer programming
0 references
branch-and-cut
0 references
