On nonintegral vertices of 3-SAT problem relaxation polytope

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.

Shranjeno v:
Bibliografske podrobnosti
Glavni avtor: A. V. Nikolaev
Format: Artigo
Jezik:Inglês
Izdano: Yaroslavl State University 2010-06-01
Serija:Modelirovanie i Analiz Informacionnyh Sistem
Teme:
combinatorial optimization
computational complexity theory
polytopes
face lattice
linear programming
Online dostop:https://www.mais-journal.ru/jour/article/view/1031
Oznake: Označite
Brez oznak, prvi označite!

Podobne knjige/članki