A large neighborhood search heuristic for the longest common subsequence problem
Year of publication: |
2008
|
---|---|
Authors: | Easton, Todd ; Singireddy, Abhilash |
Published in: |
Journal of heuristics. - Norwell, Mass. [u.a.] : Springer Science + Business Media, ISSN 1381-1231, ZDB-ID 1333974-6. - Vol. 14.2008, 3, p. 271-283
|
Subject: | Heuristik | Heuristics | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
An efficient iterated local search algorithm for the total tardiness blocking flow shop problem
Ribas, Imma, (2013)
-
A time predefined variable depth search for nurse rostering
Burke, Edmund K., (2013)
-
A GRASP approach to transporter scheduling for ship assembly block operations management
Park, Changkyu, (2013)
- More ...
-
A large neighborhood search heuristic for the longest common subsequence problem
Easton, Todd, (2008)
-
Differences in Wage Levels Among Metropolitan Areas: Less-educated Workers in the United States
Easton, Todd, (2000)
-
Easton, Todd, (2007)
- More ...