An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.23, Iss.3-4, 1998-01, pp. : 229-245

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 efficient approximation algorithm for the survivable network design problem

By Gabow H.N. Goemans M.X. Williamson D.P.

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 13-40

Elsevier

Access to resources Recommend Favorite

A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes

By Murty Katta

Optimization Letters, Vol. 3, Iss. 2, 2009-03 ,pp. : 211-237

Springer Publishing Company

Access to resources Recommend Favorite

Minimal Solutions to the Box Problem

By Chuang Jer-Chin (Luke)

The College Mathematics Journal, Vol. 40, Iss. 5, 2009-11 ,pp. : 354-360

Mathematical Association of America

Access to resources Recommend Favorite

Branch-and-Bound Variant of an Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem

By Fülöp J. Muu L.D.

Journal of Optimization Theory and Applications, Vol. 105, Iss. 1, 2000-04 ,pp. : 37-54

Springer Publishing Company

Access to resources Recommend Favorite

An Efficient Algorithm for Solving the Inverse Problem of Locating the Interfaces Using the Frequency Sounding Data

By Timonov A. Klibanov M.V.

Journal of Computational Physics, Vol. 183, Iss. 2, 2002-12 ,pp. : 422-437

Academic Press

Access to resources Recommend Favorite