The Integer Hull of a Convex Rational Polytope (original) (raw)
Related papers
On integer polytopes with few nonzero vertices
Operations Research Letters, 2013
On integer programing with bounded determinants
2015
Some efficiently solvable problems over integer partition polytopes
Discrete Applied Mathematics, 2015
Binary positive semidefinite matrices and associated integer polytopes
Mathematical Programming, 2012
Effective lattice point counting in rational convex polytopes
Journal of Symbolic Computation, 2004
On the number of vertices in integer linear programming problems
2006
An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
Mathematics of Operations Research, 2010
The convex hull of a linear congruence relation in zero-one variables
Minendra Rijal, Dimitris Alevras
ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research, 1995
Effective lattice point counting in rational convex
2004
Integer Programming, Lattices, and Results in Fixed Dimension
Handbooks in Operations Research and Management Science, 2005
Polytopes Related to Some Polyhedral Norms
Total dual integrality and integer polyhedra
Linear algebra and its applications, 1979
A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes
Optimization Letters, 2008
polymake in Linear and Integer Programming
Polynomial inequalities representing polyhedra
Mathematical Programming, 2005
Mod‐2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets
SIAM Journal on Discrete Mathematics, 2006
Convex Integer Optimization by Constantly Many Linear Counterparts
arXiv (Cornell University), 2012
Gap Inequalities for the Cut Polytope
European Journal of Combinatorics, 1996
Generalized Chvátal-Gomory closures for integer programs with bounds on variables
Mathematical Programming, 2020
On the representation of polyhedra by polynomial inequalities
2002
On the upper-bound conjecture for convex polytopes
Journal of Combinatorial Theory, Series B, 1971
arXiv (Cornell University), 2006
Two Problems on Lattice Point Enumeration of Rational Polytopes
2017
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
Mathematical Programming, 2008
On the convex hull of projective planes
RAIRO - Operations Research, 2008
On the knapsack closure of 0-1 Integer Linear Programs
arXiv (Cornell University), 2015
On integer programming with bounded determinants
Optimization Letters
Some characteristics of the simple Boolean quadric polytope extension
arXiv: Combinatorics, 2016
Lecture Notes in Computer Science, 2004
Integer Polynomial Optimization in Fixed Dimension
Mathematics of Operations Research, 2006
On the integer max-linear programming problem,
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
Mathematical Programming, 2017
Quadratic Integer Programming: Complexity and Equivalent Forms
Ioannis (Yannis) P Androulakis
2009
New bounds on the unconstrained quadratic integer programming problem
Journal of Global Optimization, 2007