|
Avtomatika i Telemekhanika, 2004, Issue 3, Pages 35–42
(Mi at1537)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
Discrete Optimization
Investigation of maximum and minimum satisfiability problems using $L$-partition
A. V. Adel'shin Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Science
Abstract:
Problems of the maximum and the minimum satisfiability on the basis of the integer linear programming and $L$-partition are studied. The $L$-structure of polyhedrons of the problems is investigated. Families are set up of unweighted problems of the maximum and the minimum satisfiability, the powers of $L$-coverings of which grow exponentially with an increase in the number of variables in a formula.
Citation:
A. V. Adel'shin, “Investigation of maximum and minimum satisfiability problems using $L$-partition”, Avtomat. i Telemekh., 2004, no. 3, 35–42; Autom. Remote Control, 65:3 (2004), 388–395
Linking options:
https://www.mathnet.ru/eng/at1537 https://www.mathnet.ru/eng/at/y2004/i3/p35
|
Statistics & downloads: |
Abstract page: | 157 | Full-text PDF : | 62 | References: | 28 | First page: | 2 |
|