Sciweavers

CORR
2010
Springer

Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability

13 years 3 months ago
Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the MCM problem optimally. To the best of our knowledge, the proposed encodings and the optimization algorithm are the first formalization of the MCM problem in a PBS manner. This report evaluates the complexity of the problem size and the performance of several PBS solvers over three encodings.
Nuno P. Lopes, Levent Aksoy, Vasco M. Manquinho, J
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2010
Where CORR
Authors Nuno P. Lopes, Levent Aksoy, Vasco M. Manquinho, José Monteiro
Comments (0)