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.

Sparad:
Bibliografiska uppgifter
Huvudupphovsman: A. V. Nikolaev
Materialtyp: Artigo
Språk:Inglês
Publicerad: Yaroslavl State University 2010-06-01
Serie:Modelirovanie i Analiz Informacionnyh Sistem
Ämnen:
combinatorial optimization
computational complexity theory
polytopes
face lattice
linear programming
Länkar:https://www.mais-journal.ru/jour/article/view/1031
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!

Liknande verk