S-LCG is a deterministic search algorithm based on a structured linear congruential generator that reaches within 1% of the global optimum on 83.3% of tested benchmark cases across dimensions 2 to 30 while outperforming genetic algorithms and other binary methods.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
S-LCG: Structured Linear Congruential Generator-Based Deterministic Algorithm for Search and Optimization
S-LCG is a deterministic search algorithm based on a structured linear congruential generator that reaches within 1% of the global optimum on 83.3% of tested benchmark cases across dimensions 2 to 30 while outperforming genetic algorithms and other binary methods.