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

04/29/2021
by   Matthias Brugger, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/08/2014

Rational Closure in SHIQ

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

A reconstruction of the multipreference closure

The paper describes a preferential approach for dealing with exceptions ...
01/18/2018

Reasoning about multiple aspects in DLs: Semantics and Closure Construction

Starting from the observation that rational closure has the undesirable ...
05/09/2018

On the number of integer points in translated and expanded polyhedra

We prove that the problem of minimizing the number of integer points inp...
06/29/2018

Deciding the Closure of Inconsistent Rooted Triples is NP-Complete

Interpreting three-leaf binary trees or rooted triples as constraints y...
07/08/2018

Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure

Reasoning about exceptions in ontologies is nowadays one of the challeng...
12/04/2018

Rigid Foldability is NP-Hard

In this paper, we show that deciding rigid foldability of a given crease...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.