A large neighborhood search heuristic for the longest common subsequence problem (Q953288): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10732-007-9038-y / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1981915844 / rank | |||
Normal rank |
Revision as of 01:33, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A large neighborhood search heuristic for the longest common subsequence problem |
scientific article |
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