Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On a generalization of the Chvatal-Gomory closure   Many practical integer programming problems involve variables with one or
two-sided bounds. Dunkel and Schulz (2012) considered a strengthened version of
Chvatal-Gomory (CG) inequalities that use 0-1 bounds on variables, and showed
that the set of points in a rational polytope that satisfy all these
strengthened inequalities is a polytope. Recently, we generalized this result
by considering strengthened CG inequalities that use all variable bounds. In
this paper, we generalize further by considering not just variable bounds, but
general linear constraints on variables. We show that all points in a rational
polyhedron that satisfy such strengthened CG inequalities form a rational
polyhedron. We also consider mixed-integer sets defined by linear constraints,
to which we extend our polyhedrality result by defining the strengthened CG
inequalities on integer variables.

1
The categories of this paper are: cs
6
The categories of this paper are: astro-ph
9
The categories of this paper are: nlin
17
The categories of this paper are: q-fin
35
The categories of this paper are: mtrl-th
12
The categories of this paper are: nucl-th
21
The categories of this paper are: adap-org
4
The categories of this paper are: cond-mat
20
The categories of this paper are: acc-phys
31
The categories of this paper are: ao-sci
24
The categories of this paper are: dg-ga
33
The categories of this paper are: plasm-ph
5
The categories of this paper are: gr-qc
11
The categories of this paper are: hep-lat
10
The categories of this paper are: q-bio
29
The categories of this paper are: funct-an