A large neighborhood search heuristic for the longest common subsequence problem (Q953288)
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 large neighborhood search heuristic for the longest common subsequence problem |
scientific article; zbMATH DE number 5366800
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A large neighborhood search heuristic for the longest common subsequence problem |
scientific article; zbMATH DE number 5366800 |
Statements
A large neighborhood search heuristic for the longest common subsequence problem (English)
0 references
17 November 2008
0 references
longest common subsequence
0 references
dynamic programming
0 references
large neighborhood search
0 references
heuristic
0 references
0 references
0.8408984541893005
0 references
0.8171396851539612
0 references
0.8131957650184631
0 references
0.8108109831809998
0 references
0.806473970413208
0 references
