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.

Tallennettuna:
Bibliografiset tiedot
Päätekijä: A. V. Nikolaev
Aineistotyyppi: Artigo
Kieli:Inglês
Julkaistu: Yaroslavl State University 2010-06-01
Sarja:Modelirovanie i Analiz Informacionnyh Sistem
Aiheet:
combinatorial optimization
computational complexity theory
polytopes
face lattice
linear programming
Linkit:https://www.mais-journal.ru/jour/article/view/1031
Tagit: Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!

Samankaltaisia teoksia