On the public citation graph
An analysis of a reordering operator on a GA-hard problem
0 signed · 43 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.1145/988616.988619openalex-snapshot
From dissertation abstracts international
inferredcites →https://doi.org/10.5860/choice.27-0936openalex-snapshot
Genetic algorithms in search, optimization, and machine learning
inferredcites →https://doi.org/10.7302/10207openalex-snapshot
The Behavior Of Adaptive Systems Which Employ Genetic And Correlation Algorithms.
inferredcites →https://doi.org/10.7302/10648openalex-snapshot
Nonlinearities In Genetic Adaptive Search.
inferredcites →https://doi.org/10.7551/mitpress/1090.001.0001openalex-snapshot
Adaptation in Natural and Artificial Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45105-6_96openalex-snapshot
An Analysis of a Reordering Operator with Tournament Selection on a GA-Hard Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-24854-5_100openalex-snapshot
Evolving Genotype to Phenotype Mappings with a Multiple-Chromosome Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/978-94-011-3648-8_1openalex-snapshot
Genetic Algorithms as a Computational Theory of Conceptual Design
inferred← citeshttps://doi.org/10.1007/bf00993046openalex-snapshot
What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation
inferred← citeshttps://doi.org/10.1007/s10710-007-9045-7openalex-snapshot
Detecting the epistatic structure of generalized embedded landscape
inferred← citeshttps://doi.org/10.1007/s10845-015-1109-6openalex-snapshot
A genetic algorithm for operation sequencing in CAPP using edge selection based encoding strategy
inferred← citeshttps://doi.org/10.1016/0004-3702(93)90037-copenalex-snapshot
Isomorphisms of genetic algorithms
inferred← citeshttps://doi.org/10.1016/0305-0548(93)e0025-oopenalex-snapshot
An analysis of an embedded crossover scheme on a GA-hard problem
inferred← citeshttps://doi.org/10.1016/b978-0-08-040806-4.50031-9openalex-snapshot
apGA: AN ADAPTIVE PARALLEL GENETIC ALGORITHM
inferred← citeshttps://doi.org/10.1016/b978-0-08-050684-5.50006-9openalex-snapshot
Deceptiveness and Genetic Algorithm Dynamics* *This research was supported by the National Science Foundation (IRI-8917545), and by the Air Force office of Scientific Research and the Office of Naval Research Contract # F49620-90-C-00033.
inferred← citeshttps://doi.org/10.1016/b978-0-08-050684-5.50017-3openalex-snapshot
Fundamental Principles of Deception in Genetic Search
inferred← citeshttps://doi.org/10.1016/b978-0-08-050684-5.50018-5openalex-snapshot
Isomorphisms Of Genetic Algorithms
inferred← citeshttps://doi.org/10.1016/j.cie.2021.107455openalex-snapshot
A learning interactive genetic algorithm based on edge selection encoding for assembly job shop scheduling problem
inferred← citeshttps://doi.org/10.1016/s0045-7825(99)00387-4openalex-snapshot
A perspective on the foundation and evolution of the linkage learning genetic algorithms
inferred← citeshttps://doi.org/10.1016/s0045-7825(99)00388-6openalex-snapshot
Linkage learning through probabilistic expression
inferred← citeshttps://doi.org/10.1016/s0303-2647(02)00134-xopenalex-snapshot
The evolution of evolvability in genetic linkage patterns
inferred← citeshttps://doi.org/10.1023/a:1008312316286openalex-snapshot
Representation Operators and Computation
inferred← citeshttps://doi.org/10.1023/a:1012813326519openalex-snapshot
Distributed, Collaborative Data Analysis from Heterogeneous Sites Using a Scalable Evolutionary Technique
inferred← citeshttps://doi.org/10.1023/a:1022626114466openalex-snapshot
What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation
inferred← citeshttps://doi.org/10.1038/s41598-022-22170-8openalex-snapshot
An aphid inspired metaheuristic optimization algorithm and its application to engineering
inferred← citeshttps://doi.org/10.1080/09528139008953717openalex-snapshot
Representational issues in genetic optimization
inferred← citeshttps://doi.org/10.1109/ccece.2003.1226091openalex-snapshot
A hybrid genetic algorithm for MOSFET parameter extraction
inferred← citeshttps://doi.org/10.1109/cec.2004.1330863openalex-snapshot
Effects of phenotypic feedback and the coupling of genotypic and phenotypic spaces in genetic searches
inferred← citeshttps://doi.org/10.1109/cec.2005.1554692openalex-snapshot
Flexible protein-ligand docking using particle swarm optimization
inferred← citeshttps://doi.org/10.1109/cec.2006.1688542openalex-snapshot
TGIF: An Ancient Game Inspired Framework for Chromosome Representations
inferred← citeshttps://doi.org/10.1109/cec.2009.4983121openalex-snapshot
Viral infection + tropism for improving small population performance under noisy environment
inferred← citeshttps://doi.org/10.1109/cec.2011.5949780openalex-snapshot
Examining the use of a non-trivial fixed genotype-phenotype mapping in genetic algorithms to induce phenotypic variability over deceptive uncertain landscapes
inferred← citeshttps://doi.org/10.1109/icec.1997.592259openalex-snapshot
The gambler's ruin problem, genetic algorithms, and the sizing of populations
inferred← citeshttps://doi.org/10.1109/ictai.2004.32openalex-snapshot
Analysing the effects of combining fitness scaling and inversion in genetic algorithms
inferred← citeshttps://doi.org/10.1109/tevc.2021.3130838openalex-snapshot
A Review of Population-Based Metaheuristics for Large-Scale Black-Box Global Optimization—Part I
inferred← citeshttps://doi.org/10.1145/1389095.1389319openalex-snapshot
Improving small population performance under noise with viral infection + tropism
inferred← citeshttps://doi.org/10.1145/2576768.2598219openalex-snapshot
Solving GA-hard problems with EMMRS and GPGPUs
inferred← citeshttps://doi.org/10.11499/sicejl1962.32.10openalex-snapshot
Toward a Better Understanding of Mixing in Genetic Algorithms
inferred← citeshttps://doi.org/10.1162/10636560151075112openalex-snapshot
Gene Expression and Fast Construction of Distributed Evolutionary Representation
inferred← citeshttps://doi.org/10.1162/evco.1999.7.3.231openalex-snapshot
The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations
inferred← citeshttps://doi.org/10.1201/9781420050073.ax1openalex-snapshot
An Indexed Bibliography of Genetic Algorithms
inferred← citeshttps://doi.org/10.3390/jmse11071360openalex-snapshot
Optimization of Shipping Routes for Container Ships from Indonesia to the Asia-Pacific Using Heuristic Algorithms
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.