|
Prikladnaya Diskretnaya Matematika, 2013, Number 1(19), Pages 99–109
(Mi pdm395)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Computational Methods in Discrete Mathematics
Study of discrete optimization problems with logical constraints based on regular partitions
A. A. Kolokolova, A. V. Adelshina, D. I. Yagofarovab a 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.
Citation:
A. A. Kolokolov, A. V. Adelshin, D. I. Yagofarova, “Study of discrete optimization problems with logical constraints based on regular partitions”, Prikl. Diskr. Mat., 2013, no. 1(19), 99–109
Linking options:
https://www.mathnet.ru/eng/pdm395 https://www.mathnet.ru/eng/pdm/y2013/i1/p99
|
Statistics & downloads: |
Abstract page: | 289 | Full-text PDF : | 127 | References: | 42 | First page: | 1 |
|