Randomness in heuristics: An experimental investigation for the maximum satisfiability problem

MaRDI QIDQ2768133zbMATH OpenFDO

Authors H. Drias

Publication date 27 November 2002

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

G-bitgenetic algorithmGSAT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
• scientific article; zbMATH DE number 956862
• scientific article; zbMATH DE number 1114009
• Local search algorithms for SAT: an empirical evaluation
• Scatter search and genetic algorithms for MAX-SAT problems

This page was built for publication: Randomness in heuristics: An experimental investigation for the maximum satisfiability problem

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