A branch-and-cut approach to the repetition-free longest common subsequence problem (Q2883608)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch-and-cut approach to the repetition-free longest common subsequence problem |
scientific article; zbMATH DE number 6033965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut approach to the repetition-free longest common subsequence problem |
scientific article; zbMATH DE number 6033965 |
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
0.8615086674690247
0 references
0.8530681133270264
0 references
0.8455306887626648
0 references
0.8117295503616333
0 references
0.8099260926246643
0 references
