Adding cardinality constraints to integer programs with applications to maximum satisfiability

Adding cardinality constraints to integer programs with applications to maximum satisfiability

0.00 Avg rating—0 Votes
Article ID: iaor2009667
Country: Netherlands
Volume: 105
Issue: 5
Start Page Number: 194
End Page Number: 198
Publication Date: Feb 2008
Journal: Information Processing Letters
Authors: , ,
Abstract:

Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of satisfied clauses among all such assignments. If each clause is restricted to have at most 𝓁 literals, we obtain the problem Max-𝓁SAT-CC.

Reviews

Required fields are marked *. Your email address will not be published.