Related papers: Enumerating projections of integer points in unbou…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…
This paper presents algorithms for solving multiobjective integer programming problems. The algorithm uses Barvinok's rational functions of the polytope that defines the feasible region and provides as output the entire set of nondominated…
The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Despr\'es, Numer.…
Given an integral $d \times n$ matrix $A$, the well-studied affine semigroup $\mbox{ Sg} (A)=\{ b : Ax=b, \ x \in {\mathbb Z}^n, x \geq 0\}$ can be stratified by the number of lattice points inside the parametric polyhedra $P_A(b)=\{x:…
We show that one can enumerate the vertices of the convex hull of integer points in polytopes whose constraint matrices have bounded and nonzero subdeterminants, in time polynomial in the dimension and encoding size of the polytope. This…
An efficient algorithm to enumerate the vertices of a two-dimensional (2D) projection of a polytope, is presented in this paper. The proposed algorithm uses the support function of the polytope to be projected and enumerated for vertices.…
The parametric lattice-point counting problem is as follows: Given an integer matrix $A \in Z^{m \times n}$, compute an explicit formula parameterized by $b \in R^m$ that determines the number of integer points in the polyhedron $\{x \in…
The main theme of this dissertation is the study of the lattice points in a rational convex polyhedron and their encoding in terms of Barvinok's short rational functions. The first part of this thesis looks into theoretical applications of…
Let a polytope $P$ be defined by a system $A x \leq b$. We consider the problem of counting the number of integer points inside $P$, assuming that $P$ is $\Delta$-modular, where the polytope $P$ is called $\Delta$-modular if all the rank…
This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…
We introduce variants of Barvinok's algorithm for counting lattice points in polyhedra. The new algorithms are based on irrational signed decomposition in the primal space and the construction of rational generating functions for cones with…
It is generally hard to count, or even estimate, how many integer points lie in a polytope P. Barvinok and Hartigan have approached the problem by way of information theory, showing how to efficiently compute a random vector which samples…
We establish Marstrand-type projection theorems for orthogonal projections along geodesics onto m-dimensional subspaces of hyperbolic $n$-space by a geometric argument. Moreover, we obtain a Besicovitch-Federer type characterization of…
While several classes of integer linear optimization problems are known to be solvable in polynomial time, far fewer tractability results exist for integer nonlinear optimization. In this work, we narrow this gap by identifying a broad…
We expand on a result of Barvinok and Hartigan to derive asymptotic formulas for the number of integer and binary integer points in a wide class of multi-index $k_1\times k_2\times \ldots \times k_{\nu}$ transportation polytopes. A simple…
We study the complexity of computing the projection of an arbitrary $d$-polytope along $k$ orthogonal vectors for various input and output forms. We show that if $d$ and $k$ are part of the input (i.e. not a constant) and we are interested…
A formula for calculating Extensions of (mainly integral) Polynomial Functors is established, based upon projective resolutions. Sample computations are performed, which, in particular, exhibit a surprising non-trivial extension of Divided…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
We address the problem of projecting a point onto a quadratic hypersurface, more specifically a central quadric. We show how this problem reduces to finding a given root of a scalar-valued nonlinear function. We completely characterize one…