On the public citation graph
A Novel Approach to Designing Surrogate-assisted Genetic Algorithms by Combining Efficient Learning of Walsh Coefficients and Dependencies
0 signed · 31 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01531277openalex-snapshot
Sufficient conditions for deceptive and easy binary functions
inferredcites →https://doi.org/10.1016/j.ins.2003.03.029openalex-snapshot
The parameter-less genetic algorithm in practice
inferredcites →https://doi.org/10.1016/j.jcss.2010.08.011openalex-snapshot
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
inferredcites →https://doi.org/10.1016/j.swevo.2018.02.005openalex-snapshot
Multi-objective Gene-pool Optimal Mixing Evolutionary Algorithm with the Interleaved Multi-start Scheme
inferredcites →https://doi.org/10.1145/1569901.1570018openalex-snapshot
Performance of evolutionary algorithms on NK landscapes with nearest neighbor interactions and tunable overlap
inferredcites →https://doi.org/10.1145/2001576.2001661openalex-snapshot
Optimal mixing evolutionary algorithms
inferredcites →https://doi.org/10.1145/2330163.2330205openalex-snapshot
Predetermined versus learned linkage models
inferredcites →https://doi.org/10.1145/2330163.2330247openalex-snapshot
Linkage neighbors, optimal mixing and forced improvements in genetic algorithms
inferredcites →https://doi.org/10.1145/2576768.2598282openalex-snapshot
Efficient global optimization for combinatorial problems
inferredcites →https://doi.org/10.1145/2908812.2908831openalex-snapshot
A New Evaluation Function for Clustering
inferredcites →https://doi.org/10.1145/3071178.3071285openalex-snapshot
Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search
inferredcites →https://doi.org/10.1145/3321707.3321760openalex-snapshot
Convolutional neural network surrogate-assisted GOMEA
inferredcites →https://doi.org/10.1145/3321707.3321800openalex-snapshot
Walsh functions as surrogate model for pseudo-boolean optimization problems
inferredcites →https://doi.org/10.1155/2016/9420460openalex-snapshot
A Review of Surrogate Assisted Multiobjective Evolutionary Algorithms
inferredcites →https://doi.org/10.1162/10636560151075112openalex-snapshot
Gene Expression and Fast Construction of Distributed Evolutionary Representation
inferredcites →https://doi.org/10.1162/1063656043138914openalex-snapshot
Efficient Linkage Discovery by Limited Probing
inferredcites →https://doi.org/10.1162/evco.1999.7.4.377openalex-snapshot
Linkage Identification by Non-monotonicity Detection for Overlapping Functions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-57712-3_2openalex-snapshot
Sparse Surrogate Model for Optimization: Example of the Bus Stops Spacing Problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2023.110061openalex-snapshot
Walsh-based surrogate-assisted multi-objective combinatorial optimization: A fine-grained analysis for pseudo-boolean functions
inferred← citeshttps://doi.org/10.1109/tetci.2023.3301794openalex-snapshot
A Surrogate-Assisted Evolutionary Algorithm for Seeking Multiple Solutions of Expensive Multimodal Optimization Problems
inferred← citeshttps://doi.org/10.1109/tevc.2024.3496193openalex-snapshot
From Direct to Directional Variable Dependencies—Nonsymmetrical Dependencies Discovery in Real-World and Theoretical Problems
inferred← citeshttps://doi.org/10.1145/3512290.3528828openalex-snapshot
Solving multi-structured problems by introducing linkage kernels into GOMEA
inferred← citeshttps://doi.org/10.1145/3583131.3590425openalex-snapshot
Fourier Transform-based Surrogates for Permutation Problems
inferred← citeshttps://doi.org/10.1145/3651166openalex-snapshot
Effective and Imperceptible Adversarial Textual Attack Via Multi-objectivization
inferred← citeshttps://doi.org/10.1145/3712255.3734293openalex-snapshot
The Pitfalls and Potentials of Adding Gene-invariance to Optimal Mixing
inferred← citeshttps://doi.org/10.1145/3712256.3726419openalex-snapshot
Seeking and leveraging alternative variable dependency concepts in gray-box-elusive bimodal land-use allocation problems
inferred← citeshttps://doi.org/10.1145/3712256.3726426openalex-snapshot
Subfunction Structure Matters: A New Perspective on Local Optima Networks
inferred← citeshttps://doi.org/10.1145/3729878.3746624openalex-snapshot
Conditional Direct Empirical Linkage Discovery for Solving Multi-Structured Problems
inferred← citeshttps://doi.org/10.1162/evco_a_00338openalex-snapshot
Parameterless Gene-Pool Optimal Mixing Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1162/evco_a_00368openalex-snapshot
P-NP Instance Decomposition Based on the Fourier Transform for Solving the Linear Ordering Problem
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.