scientific article; zbMATH DE number 1149448

zbMATH Open0894.68041MaRDI QIDQ4386971FDOQ4386971

Author name not available (Why is that?)

Publication date: 13 May 1998

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

local search algorithmsplateau moves

Mathematics Subject Classification ID

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

Cited In (12)

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

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)