Related papers: Extended Formulations for Packing and Partitioning…
Mixed integer set representations, and specifically hybrid zonotopes, have enabled new techniques for reachability and verification of nonlinear and hybrid systems. Mixed-integer sets which have the property that their convex relaxation is…
We give an incremental polynomial time algorithm for enumerating the vertices of any polyhedron $\mathcal{P}(A,\mathbf{1})=\{x\in\RR^n \mid Ax\geq \b1,~x\geq \b0\}$, when $A$ is a totally unimodular matrix. Our algorithm is based on…
This paper investigates the extension complexity of polytopes by exploiting the correspondence between non-negative factorizations of slack matrices and randomized communication protocols. We introduce a geometric characterization of…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
This paper presents an algorithmic study of a class of covering mixed-integer linear programming problems which encompasses classic cover problems, including multidimensional knapsack, facility location and supplier selection problems. We…
In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining…
Given two elements of a vector space acted on by a reductive group, we ask whether they lie in the same orbit, and if not, whether one lies in the orbit closure of the other. We develop techniques to optimize the orbit and orbit closure…
We derive a closed form description of the convex hull of mixed-integer bilinear covering set with bounds on the integer variables. This convex hull description is determined by considering some orthogonal disjunctive sets defined in a…
The aims of this article are two-fold. First, we give a geometric characterization of the optimal basic solutions of the general linear programming problem (no compactness assumptions) and provide a simple, self-contained proof of it…
We introduce and study integral planes associated with crystallographic and non-crystallographic integral systems in real composition algebras. For an integral order $\Order$ in such an algebra we define the plane $\Order^{2}$ with…
Navigating rigid body objects through crowded environments can be challenging, especially when narrow passages are presented. Existing sampling-based planners and optimization-based methods like mixed integer linear programming (MILP)…
We present a unifying framework for generating extended formulations for the polyhedral outer approximations used in algorithms for mixed-integer convex programming (MICP). Extended formulations lead to fewer iterations of outer…
Mirkovic and Vilonen discovered a canonical basis of algebraic cycles for the intersection homology of (the closures of the strata of) the loop Grassmannian. The moment map images of these varieties are a collection of polytopes, and they…
This paper is a self-contained presentation of certain aspects of the theory of weighted Sobolev spaces and elliptic operators on non-compact Riemannian manifolds. Specifically, we discuss (i) the standard and weighted Sobolev Embedding…
We prove that every 0/1-polytope has a unique Minkowski decomposition into indecomposable polytopes, up to translation of summands. The summands lie in pairwise orthogonal subspaces. Thus, every 0/1-polytope is the Cartesian product of…
In most of today's exactly solved classes of polyominoes, either all members are convex (in some way), or all members are directed, or both. If the class is neither convex nor directed, the exact solution uses to be elusive. This paper is…
We give combinatorial models for the homotopy type of complements of elliptic arrangements (i.e., certain sets of abelian subvarieties in a product of elliptic curves). We give a presentation of the fundamental group of such spaces and, as…
We prove a product formula for the remaining cases of the weighted enumeration of self-complementary plane partitions contained in a given box where adding one half of an orbit of cubes and removing the other half of the orbit changes the…
A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving non-convex QCQP to global…
Moser asked whether the collection of rectangles of dimensions 1 x 1/2, 1/2 x 1/3, 1/3 x 1/4, ..., whose total area equals 1, can be packed into the unit square without overlap, and whether the collection of squares of side lengths 1/2,…