We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set, 3-assignment. For comparing two families of polytopes we use the following method. We say that a family is affinely reduced to a family if for every polytope ∈ there exists ∈ such that is affinely equivalent to or to a face of , where dim = ((dim ) ) for some constant . Under this comparison the above-mentioned families are splitted into two equivalence classes. We show also that these two classes are simpler (in the above sense) than the families of polytopes of the following problems: set covering, traveling salesman, 0-1 knapsack problem, 3-satisfiability, cubic subgraph, partial ordering. In particular, Boolean quadratic polytopes appear as faces of polytopes in every mentioned families.Article is published in the author's wording.
283This paper considers families of combinatorial polytopes for which the problem of recognizing the nonadjacency of two arbitrary vertices is NP com plete. It is shown that all such polytopes contain spe cial 0/1 programming problems as faces, for which the problem of recognizing the nonadjacency of verti ces is NP complete too.A combinatorial polytope is usually specified as fol lows. Consider a set X ⊆ {0, 1} d of vertices of the d dimensional 0/1 cube satisfying certain constraints, specific for each problem. The polytope itself is defined as the convex hull of the set X, which is simul taneously the vertex set of the polytope. In what fol lows, we identify polytopes with their vertex sets.The study of graph properties of combinatorial polytopes became particularly popular in the 1970s [1,2] in relation to the potential possibility of solving the corresponding combinatorial problems by using the local search technique (which, in particular, uses the simplex method). At present, it has become a rule to begin searching for an efficient solution of a combina torial problem with studying properties of the associ ated polytope. One of the popular problems in this direction is searching for a simple adjacency criterion for polytope vertices. It is known from papers by Papadimitriou [3], Matsui [4], Bondarenko and Yurov [5], Alfakih and Murty [6], and Fiorini [7] that, for some families of combinatorial polytopes, the problem of recognizing the nonadjacency of vertices is NP complete. This gives rise to the natural question of whether the polytopes considered in [3-7] have a common constructive special feature, which deter mines the similarity of their properties. It turns out (details are given below) that each of these polytopes contains, as a face, the polytope corresponding to a 0/1 programming problem of special form. One of the properties of the latter polytope is the NP complete ness of the recognition of vertex nonadjacency.We proceed to list the polytopes considered in [3][4][5][6][7]. We conventionally divide them into two groups. The polytopes from the first group can be well described as 0/1 programming problems. In this case, we set x = (x 1 , x 2 , …, x d ) ∈ {0, 1} d . The second group consists of polytopes related to problems on graphs. If the graph corresponding to a problem under consideration is the complete unoriented graph G = (V, E) on n vertices, then the value of a coordinate x ij with 1 ≤ i < j ≤ n of a vector x ∈ {0, 1 symbolizes the presence or absence of the edge (v i , v j ) in the subgraph G(x) of the graph G. In such cases, x is often referred to as the characteristic vector of the graph G(x). Similarly, for the complete directed graph D = {V, A} on n vertices, the set of vectors x ∈ {0, 1} n(n -1) is in one to one cor respondence with the set of all subgraphs D(x) in the graph D.The polytope of covers SC md is defined as the con vex hull of all solutions x ∈ {0, 1} d of the inequality Ax ≥ 1, where A is an m × d, а 1 -m 0/1 matrix and 1 is the m vector all of whose coordinates equal 1...
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.