Tight Bound on Johnson's Algorithm for Maximum Satisfiability

ISSN： 0022-0000

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

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

An effective heuristic algorithm for the maximum satisfiability problem

By Menaï Mohamed Batouche Mohamed

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

Springer Publishing Company

Access to resources Recommend Favorite

An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments

By Tomita Etsuji Kameda Toshikatsu

Journal of Global Optimization, Vol. 37, Iss. 1, 2007-01 ,pp. : 95-111

Springer Publishing Company

Access to resources Recommend Favorite

Satisfiability tests and time-bound adjustmentsfor cumulative scheduling problems

By Baptiste P. Le Pape C. Nuijten W.

Annals of Operations Research, Vol. 92, Iss. 1, 1999-01 ,pp. : 305-333

Springer Publishing Company

Access to resources Recommend Favorite

Investigation of Maximum and Minimum Satisfiability Problems Using L-Partition

By Adel'shin A. V.

Automation and Remote Control, Vol. 65, Iss. 3, 2004-03 ,pp. : 388-395

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A Maximum Likelihood Stereo Algorithm

By Cox I.J. Hingorani S.L. Rao S.B. Maggs B.M.

Computer Vision and Image Understanding, Vol. 63, Iss. 3, 1996-05 ,pp. : 542-567

Academic Press

Access to resources Recommend Favorite