We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A class of hypergraphs and vertices of cut polytope relaxations.
- Authors
Bondarenko, V.; Nikolaev, A.
- Abstract
The article presents a research study on the convex combination of vertices and hypergraphs of cut polytope relaxations. It mentions the monotone 3-satisfiability problem for literals monotone not-all-equal (MNAE 3-SAT). It explores some theorems for the polytypes, hypergraphs, and subsequent relaxations included in the study. It states that a positive integer was used and a system of inequalities determining the polytope. It says that the MNAE 3-SAT problem helps reduce the integerness recognition problem on the polytype.
- Subjects
CONVEX polytopes; NATURAL numbers; MONOTONE operators; MATHEMATICAL inequalities; HYPERGRAPHS; SATISFIABILITY (Computer science); NUMERICAL analysis; MATHEMATICAL proofs; MATHEMATICS theorems
- Publication
Doklady Mathematics, 2012, Vol 85, Issue 1, p46
- ISSN
1064-5624
- Publication type
Article
- DOI
10.1134/S1064562412010152