An effective heuristic algorithm for the maximum satisfiability problem

ISSN： 0924-669X

Source： Applied Intelligence, Vol.24, Iss.3, 2006-06, pp. : 227-239

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Tight Bound on Johnson's Algorithm for Maximum Satisfiability

By Chen J. Friesen D.K. Zheng H.

Journal of Computer and System Sciences, Vol. 58, Iss. 3, 1999-06 ,pp. : 622-640

Academic Press

Access to resources Recommend Favorite

A hybrid heuristic for the maximum clique problem

By Singh Alok Gupta Ashok

Journal of Heuristics, Vol. 12, Iss. 1-2, 2006-03 ,pp. : 5-22

Springer Publishing Company

Access to resources Recommend Favorite

An Effective Algorithm for the Futile Questioning Problem

By Remshagen Anja Truemper Klaus

Journal of Automated Reasoning, Vol. 34, Iss. 1, 2005-01 ,pp. : 31-47

Springer Publishing Company

Access to resources Recommend Favorite

An Application of Tabu Search Heuristic for the Maximum Edge-Weighted Subgraph Problem

By Macambira E.M.

Annals of Operations Research, Vol. 117, Iss. 1-4, 2002-11 ,pp. : 175-190

Springer Publishing Company

Access to resources Recommend Favorite

A pre-assignment heuristic algorithm for the Master Surgical Schedule Problem (MSSP)

By Tànfani Elena

Annals of Operations Research, Vol. 178, Iss. 1, 2010-07 ,pp. : 105-119

Springer Publishing Company

Access to resources Recommend Favorite