A Variable Neighborhood Walksat-Based Algorithm for MAX-SAT Problems

The simplicity of the maximum satisfiability problem (MAX-SAT) combined with its applicability in many areas of artificial intelligence and computing science made it one of the fundamental optimization problems. This NP-complete problem refers to the task of finding a variable assignment that satisf...

Descripción completa

Detalles Bibliográficos
Autor principal: Bouhmala, Noureddine
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2014
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4142167/
https://www.ncbi.nlm.nih.gov/pubmed/25177732
http://dx.doi.org/10.1155/2014/798323

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4142167/
https://www.ncbi.nlm.nih.gov/pubmed/25177732
http://dx.doi.org/10.1155/2014/798323

Ejemplares similares