Improved heuristics and a genetic algorithm for finding short supersequences

OR Spectrum

Volumn 20, Issue 1, 1998, Pages 39-45

  Branke, Jürgen ^a   Middendorf, Martin ^a   Schneider, Frerk ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Genetic algorithms; Heuristics; Supersequences

Indexed keywords

EID: 85047672324     PISSN: 01716468     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01545528     Document Type: Article

References (11)

1. Branke J, Kohlmorgen U, Schmeck H, Veith H (1995) Steuerung einer Heuristik zur Losgrößenplanung unter Kapazitätsrestriktionen mit Hilfe eine parallelen genetischen Algorithmus. In: Kühl J, Nissen V (Hrsg) Tagungsband zum Workshop Evolutionäre Algorithmen in Management Anwendungen. Universität Göttingen, Institut für Wirtschaftsinformatik, S 21-31
2. Foulser DE, Yang Q, Li M (1992) Theory and algorithms for plan merging. Artificial Intelligence 57:143-181
3. Fraser CB, Irving R (1995) Approximation algorithms for the shortest common supersequence. Nordic Journal on Computing 2:303-325
4. Fraser CB (1995) Subsequences and supersequences. PhD thesis, University of Glasgow, Department of Computer Science
5. Haase K, Kohlmorgen U (1996) Parallel genetic algorithm for the capacitated lot-sizing problem. In: Kleinschmidt et al. (eds) Operations Research Proceedings. Springer, Berlin Heidelberg New York, pp 370375
6. Jiang T, Li M (1995) On the approximation of shortest common supersequences and longest common subsequences. SIAM J Comput 24:1122-1139
7. Maier D (1978) The complexity of some problems on subsequences and supersequences. J ACM 25:322-336
8. Middendorf M (1994) More on the complexity of common superstring and supersequence problems. Theoret Comput Sci 125:205-228
9. Räihä K-J, Ukkonen E (1981) The shortest common supersequence problem over binary alphabet is NP-complete. Theoret Comput Sci 16:187-198
10. Ross P (1994) About PGA v2.7. University of Edinburgh
11. Timkovsky VG (1990) Complexity of common subsequence and supersequence problems and related problems. Cybernetics 25:565-580