DeepAI AI Chat
Log In Sign Up

On the Complexity of Recognizing Integrality and Total Dual Integrality of the {0,1/2}-Closure

by   Matthias Brugger, et al.

The {0,1/2}-closure of a rational polyhedron { x Ax ≤ b } is obtained by adding all Gomory-Chvátal cuts that can be derived from the linear system Ax ≤ b using multipliers in {0,1/2}. We show that deciding whether the {0,1/2}-closure coincides with the integer hull is strongly NP-hard. A direct consequence of our proof is that, testing whether the linear description of the {0,1/2}-closure derived from Ax ≤ b is totally dual integral, is strongly NP-hard.


page 1

page 2

page 3

page 4


Rational Closure in SHIQ

We define a notion of rational closure for the logic SHIQ, which does no...

A reconstruction of the multipreference closure

The paper describes a preferential approach for dealing with exceptions ...

Reasoning about multiple aspects in DLs: Semantics and Closure Construction

Starting from the observation that rational closure has the undesirable ...

Complexity Results for Implication Bases of Convex Geometries

A convex geometry is finite zero-closed closure system that satisfies th...

Deciding the Closure of Inconsistent Rooted Triples is NP-Complete

Interpreting three-leaf binary trees or rooted triples as constraints y...

On the Complexity of Detecting Convexity over a Box

It has recently been shown that the problem of testing global convexity ...

Consensus Division in an Arbitrary Ratio

We consider the problem of partitioning a line segment into two subsets,...