An LLM-generated, per-instance bias vector improves a BRKGA on the NP-hard Longest Run Subsequence problem, with statistically significant gains on 15 of 35 instance groups, concentrated on complex instances.
An enhanced beam search algorithm for the Shortest Common Supersequence Problem
1 Pith paper cite this work, alongside 13 external citations. Polarity classification is still indexing.
1
Pith paper citing it
13
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.NE 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
LLM-Based Instance-Driven Heuristic Bias In the Context of a Biased Random Key Genetic Algorithm
An LLM-generated, per-instance bias vector improves a BRKGA on the NP-hard Longest Run Subsequence problem, with statistically significant gains on 15 of 35 instance groups, concentrated on complex instances.