Experimental and Efficient Algorithms

DOI10.1007/B136461MaRDI QIDQ5710050zbMATH OpenOpenAlexFDO

Authors Dalila Boughaci, H. Drias

Publication date 30 November 2005

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

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Scatter search and genetic algorithms for MAX-SAT problems
• scientific article; zbMATH DE number 1728703
• scientific article; zbMATH DE number 956866
• On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
• Algorithms for the maximum satisfiability problem

Cited in

(5)

• The impact of parametrization in memetic evolutionary algorithms
• scientific article; zbMATH DE number 1728703 (Why is no real title available?)
• Meta-heuristics and artificial intelligence
• Scatter search and genetic algorithms for MAX-SAT problems
• Average-case analysis for the MAX-2SAT problem

Describes a project that uses

Uses Software

• Walksat
• SATLIB

This page was built for publication: Experimental and Efficient Algorithms

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