A Quantum Inspired Particle Swarm Algorithm for Solving the Maximum Satisfiability Problem

In this paper we investigate the use of quantum particle swarm optimization (QPSO) principles to resolve the satisfiability problem. We describe QPSOSAT, a new iterative approach for solving the well known Maximum Satisfiability problem (MAX-SAT). This latter has been shown to be NP-hard if the numb...

Full description

Saved in:
Bibliographic Details
Published in:International Journal of Combinatorial Optimization Problems and Informatics
Main Author: Abdesslem Layeb
Format: Artigo
Language:Inglês
Published: International Journal of Combinatorial Optimization Problems and Informatics 2010
Subjects:
Computación
Local search
Maximum Satisfiabilty problem
Quantum Particle Swarm Optimization
Online Access:https://www.redalyc.org/articulo.oa?id=265219741003
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items