This article is cited in 3 papers

Computational Methods in Discrete Mathematics

Study of discrete optimization problems with logical constraints based on regular partitions

A. A. Kolokolov^a, A. V. Adelshin^a, D. I. Yagofarova<sup>b

a</sup> Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
^b Omsk State University

Abstract: Some discrete optimization problems with logical constraints are considered, and the possibility of applying these problems in complex products design is investigated. The results of the studying these problems with the use of the integer programming models and regular partitions approach are reviewed. The structure and the complexity of the problems are analysed, and the algorithms for SAT and MAX-SAT problems based on this approach are proposed.

Keywords: satisfiability problem, logical constraints, integer programming, $L$-class enumeration.

UDC: 519.8