A large neighborhood search heuristic for the longest common subsequence problem (Q953288)

From MaRDI portal
Revision as of 20:23, 28 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    17 November 2008
    0 references
    0 references
    longest common subsequence
    0 references
    dynamic programming
    0 references
    large neighborhood search
    0 references
    heuristic
    0 references
    0 references