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.

Saved in:
Bibliographic Details
Main Author: A. V. Nikolaev
Format: Artigo
Language:Inglês
Published: Yaroslavl State University 2010-06-01
Series:Modelirovanie i Analiz Informacionnyh Sistem
Subjects:
combinatorial optimization
computational complexity theory
polytopes
face lattice
linear programming
Online Access:https://www.mais-journal.ru/jour/article/view/1031
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items