Recombination operators for satisfiability problems

DOI10.1007/978-3-540-24621-3_9MaRDI QIDQ5717642zbMATH OpenOpenAlexFDO

Authors Frédéric Lardeux, Frédéric Saubion, Jin-Kao Hao

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b96080

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Evolutionary computing for the satisfiability problem
• Optimal recombination in genetic algorithms for combinatorial optimization problems. I
• A genetic algorithm for probabilistic SAT problem
• Solving SAT Problem Based on Hybrid Differential Evolution Algorithm
• Scatter search and genetic algorithms for MAX-SAT problems

Cited in

(5)

• Evolutionary computing for the satisfiability problem
• Analyzing directed acyclic graph recombination
• ERA: An algorithm for reducing the epistasis of SAT problems
• Generalized satisfiability problems via operator assignments
• Autonomous operator management for evolutionary algorithms

Describes a project that uses

Uses Software

• UnitWalk

This page was built for publication: Recombination operators for satisfiability problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717642)