|
Modelirovanie i Analiz Informatsionnykh Sistem, 2010, Volume 17, Number 2, Pages 99–111
(Mi mais6)
|
|
|
|
On nonintegral vertices of 3-SAT problem relaxation polytope
A. V. Nikolaev P. G. Demidov Yaroslavl State University
Abstract:
New facts characterizing the vertex set of 3-SAT problem relaxation polytope are established. In particular, the question of preservation of nonintegral vertices under additional linear constraints of stronger relaxations is examined.
Keywords:
combinatorial optimization, computational complexity theory, polytopes, face lattice, linear programming.
Received: 11.12.2009
Citation:
A. V. Nikolaev, “On nonintegral vertices of 3-SAT problem relaxation polytope”, Model. Anal. Inform. Sist., 17:2 (2010), 99–111
Linking options:
https://www.mathnet.ru/eng/mais6 https://www.mathnet.ru/eng/mais/v17/i2/p99
|
|