@inproceedings{MayerhoferKirchwegerHuberRaidl22,
 author = {Jonas Mayerhofer and
Markus Kirchweger and
Marc Huber and
G{ü}nther R. Raidl},
 bibsource = {dblp computer science bibliography, https://dblp.org},
 biburl = {https://dblp.org/rec/conf/evoW/MayerhoferKHR22.bib},
 booktitle = {Evolutionary Computation in Combinatorial Optimization - 22nd European
Conference, EvoCOP 2022, Held as Part of EvoStar 2022, Madrid, Spain,
April 20-22, 2022, Proceedings},
 doi = {10.1007/978-3-031-04148-8\_9},
 editor = {Leslie P{\'{e}}rez C{\'{a}}ceres and
S{\'{e}}bastien V{\'{e}}rel},
 pages = {127--142},
 publisher = {Springer},
 series = {Lecture Notes in Computer Science},
 timestamp = {Thu, 07 Apr 2022 18:19:54 +0200},
 title = {A Beam Search for the Shortest Common Supersequence Problem Guided
by an Approximate Expected Length Calculation},
 url = {https://doi.org/10.1007/978-3-031-04148-8\_9},
 volume = {13222},
 year = {2022}
}