On the public citation graph

Improving the performance of evolutionary algorithms for the satisfiability problem by refining functions

https://doi.org/10.1007/bfb0056917
0 signed · 22 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4615-6089-0openalex-snapshot
Tabu Search
inferredcites →https://doi.org/10.1007/978-3-7091-7535-4_76openalex-snapshot
A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems
inferredcites →https://doi.org/10.1007/978-94-011-7108-3_57openalex-snapshot
A Study of Genetic Algorithms to Find Approximate Solutions to Hard 3-SAT Problems
inferredcites →https://doi.org/10.1007/bfb0026590openalex-snapshot
Representations, fitness functions and genetic operators for the satisfiability problem
inferredcites →https://doi.org/10.1007/bfb0040766openalex-snapshot
A superior evolutionary algorithm for 3-SAT
inferredcites →https://doi.org/10.1090/dimacs/026/29openalex-snapshot
Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability
inferredcites →https://doi.org/10.1109/icec.1994.350039openalex-snapshot
GAVaPS-a genetic algorithm with varying population size
inferredcites →https://doi.org/10.1109/icec.1997.592270openalex-snapshot
Adaptation in evolutionary computation: a survey
inferredcites →https://doi.org/10.1109/icec.1997.592273openalex-snapshot
Solving 3-SAT by GAs adapting constraint weights
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory

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-45356-3_61openalex-snapshot
Adaptive Fitness Functions for the Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-24855-2_10openalex-snapshot
Improving the Performance of a Genetic Algorithm Using a Variable-Reordering Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-02478-8_90openalex-snapshot
Evolutionary Genetic Algorithms in a Constraint Satisfaction Problem: Puzzle Eternity II
inferred← citeshttps://doi.org/10.1007/978-3-642-04843-2_27openalex-snapshot
Hybridizing Evolutionary Negative Selection Algorithm and Local Search for Large-Scale Satisfiability Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-43505-2_65openalex-snapshot
Evolutionary Computation and Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/s10732-007-9023-5openalex-snapshot
Modelling the dynamics of stochastic local search on k-sat
inferred← citeshttps://doi.org/10.1023/a:1006350622830openalex-snapshot
Local Search Algorithms for SAT: An Empirical Evaluation
inferred← citeshttps://doi.org/10.1109/4235.942527openalex-snapshot
Parallel hybrid method for SAT that couples genetic algorithms and local search
inferred← citeshttps://doi.org/10.1109/cec.2009.4983319openalex-snapshot
Evolutionary techniques in a constraint satisfaction problem: Puzzle Eternity II
inferred← citeshttps://doi.org/10.1145/335603.335912openalex-snapshot
An adaptive evolutionary algorithm for the satisfiability problem
inferred← citeshttps://doi.org/10.1162/106365602317301763openalex-snapshot
Evolutionary Algorithms for the Satisfiability Problem
inferred← citeshttps://doi.org/10.70675/932a7c81z8d8dz4199z9e7bz02240dcf3998openalex-snapshot
Reasoning and inference for (maximum) satisfiability : new insights
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.