Scatter search and genetic algorithms for MAX-SAT problems

DOI10.1007/S10852-008-9077-XzbMath1140.68062OpenAlexW2010076847MaRDI QIDQ928686

Habiba Drias, Dalila Boughaci, Belaïd Benhamou

Publication date: 11 June 2008

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-008-9077-x

zbMATH Keywords

Genetic algorithmsSatisfiabilityEvolutionary algorithmsMAX-SATScatter searchSLS

Mathematics Subject Classification ID

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

Related Items (2)

A hybrid ant colony algorithm for the winner determination problem ⋮ Scatter search with stochastic beam search on the coalition formation problem

Uses Software

• MaxSolver
• BG-WalkSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for the maximum satisfiability problem
• A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• Guided local search for solving SAT and weighted MAX-SAT problems
• MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
• A machine program for theorem-proving
• The complexity of theorem-proving procedures
• Experimental and Efficient Algorithms
• Theory and Applications of Satisfiability Testing
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: Scatter search and genetic algorithms for MAX-SAT problems