scientific article; zbMATH DE number 1149448

MaRDI QIDQ4386971zbMATH OpenFDO

Authors

Publication date 13 May 1998

zbMATH Keywords

local search algorithmsplateau moves

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 956859
• Local search algorithms for SAT: an empirical evaluation
• Phase transition for local search on planted SAT
• SAT local search algorithms: Worst-case study
• SAT local search algorithms: Worst-case study

Cited in

(12)

• AI*IA 2005: Advances in Artificial Intelligence
• Maximum satisfiability: how good are tabu search and plateau moves in the worst-case?
• The state of SAT
• A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization
• A taxonomy of exact methods for partial Max-SAT
• Application of the harmony search optimization algorithm for the solution of the multiple dam system scheduling
• Graph coloring by multiagent fusion search
• scientific article; zbMATH DE number 6276201 (Why is no real title available?)
• Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
• Problem difficulty for tabu search in job-shop scheduling
• Reduction-based MAX-3SAT with low nonlinearity and lattices under recombination
• SAT problems with chains of dependent variables

This page was built for publication:

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