Abstract
Abstract
In 1995 T. Matsui considered a special family of 0/1-polytopes with an NP-complete criterion for vertex nonadjacency relation. In 2012 the author demonstrated that all polytopes of this family appear as faces of polytopes associated with the following NP-complete problems: the travelling salesman problem, the 3-satisfiability problem, the knapsack problem, the set covering problem, the partial ordering problem, the cube subgraph problem, and some others. Here it is shown that none of the polytopes of the aforementioned special family (with the exception of the one-dimensional segment) can appear as a face in a polytope associated with the problem of the maximum independent set, the set packing problem, the set partitioning problem, and the problem of 3-assignments.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics