An island model based ant system with lookahead for the shortest supersequence problem
- 1 January 1998
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 692-701
- https://doi.org/10.1007/bfb0056911
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Improved heuristics and a genetic algorithm for finding short supersequencesOR Spectrum, 1998
- Ant system: optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- On the Approximation of Shortest Common Supersequences and Longest Common SubsequencesSIAM Journal on Computing, 1995
- Ant-Q: A Reinforcement Learning approach to the traveling salesman problemPublished by Elsevier ,1995
- More on the complexity of common superstring and supersequence problemsTheoretical Computer Science, 1994
- Theory and algorithms for plan mergingArtificial Intelligence, 1992
- Complexity of common subsequence and supersequence problems and related problemsCybernetics and Systems Analysis, 1990
- The shortest common supersequence problem over binary alphabet is NP-completeTheoretical Computer Science, 1981