A neural network based guidance for a BRKGA: an application to the longest common square subsequence problem

DOI10.1007/978-3-031-57712-3_1MaRDI QIDQ6635971

Günther R. Raidl, Marko Djukanovic, Christian Blum, Jaume Reixach

Publication date: 12 November 2024

zbMATH Keywords

neural networksgenetic algorithmsbeam searchlongest common subsequences

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Beam search for the longest common subsequence problem
• A longest common subsequence algorithm suitable for similar text strings
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• The Complexity of Some Problems on Subsequences and Supersequences
• APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †

This page was built for publication: A neural network based guidance for a BRKGA: an application to the longest common square subsequence problem