Related papers: Convex Hulls for the Unit Commitment Polytope
The convex hull of a data set $P$ is the smallest convex set that contains $P$. In this work, we present a new data structure for convex hull, that allows for efficient dynamic updates. In a dynamic convex hull implementation, the following…
A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of convex hulls that are required for polyhedral analysis to be…
This article is concerned with the problem of placing seven or eight points on the unit sphere $\mathbb{S}^2$ in $\mathbb{R}^3$ so that the surface area of the convex hull of the points is maximized. In each case, the solution is given for…
We study the polyhedral structure of the static probabilistic lot-sizing problem and propose valid inequalities that integrate information from the chance constraint and the binary setup variables. We prove that the proposed inequalities…
We study the Hausdorff distance between a random polytope, defined as the convex hull of i.i.d. random points, and the convex hull of the support of their distribution. As particular examples, we consider uniform distributions on convex…
In this paper, we study the set $\mathcal{S}^\kappa = \{ (x,y)\in\mathcal{G}\times\mathbb{R}^n : y_j = x_j^\kappa , j=1,\dots,n\}$, where $\kappa > 1$ and the ground set $\mathcal{G}$ is a nonempty polytope contained in $[0,1]^n$. This…
We study the convex hull of the graph of a quadratic function $f(\mathbf{x})=\sum_{ij\in E}x_ix_j$, where the sum is over the edge set of a graph $G$ with vertex set $\{1,\dots,n\}$. Using an approach proposed by Gupte et al. (Discrete…
This paper provides full \Matlab-code and informal correctness proofs for the lexicographic reverse search algorithm for convex hull calculations. The implementation was tested on a 1993 486-PC for various small and some larger, partially…
We consider convex hulls of random walks whose steps belong to the domain of attraction of a stable law in $\mathbb{R}^d$. We prove convergence of the convex hull in the space of all convex and compact subsets of $\mathbb{R}^d$, equipped…
The growing integration of renewable energy sources into power systems requires planning models to account for not only demand variability but also fluctuations in renewable availability during operational periods. Capturing this temporal…
This paper considers a recoverable robust single-machine scheduling problem under polyhedral uncertainty with the objective of minimising the total flow time. In this setting, a decision-maker must determine a first-stage schedule subject…
We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…
Motivated by the desire to cope with data imprecision, we study methods for taking advantage of preliminary information about point sets in order to speed up the computation of certain structures associated with them. In particular, we…
We present a simple algorithm for determining the extremal points in Euclidean space whose convex hull is the nth polytope in the sequence known as the multiplihedra. This answers the open question of whether the multiplihedra could be…
We consider the convex hull of the perturbed point process comprised of $n$ i.i.d. points, each distributed as the sum of a uniform point on the unit sphere $\S^{d-1}$ and a uniform point in the $d$-dimensional ball centered at the origin…
We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…
We provide quantitative inner and outer bounds for the symmetric quasiconvex hull $Q^e(\mathcal{U})$ on linear strains generated by three-well sets $\mathcal{U}$ in $\mathbb{R}^{2\times 2}_{sym}$. In our study, we consider all possible…
We prove two-sided bounds on the expected values of several geometric functionals of the convex hull of Brownian motion in $\mathbb{R}^n$ and their inverse processes. This extends some recent results of McRedmond and Xu (2017),…
Constant workspace algorithms use a constant number of words in addition to the read-only input to the algorithm. In this paper, we devise algorithms to efficiently compute relative hulls in the plane using a constant workspace.…
For unconstrained control problems, a local convergence rate is established for an $hp$-method based on collocation at the Radau quadrature points in each mesh interval of the discretization. If the continuous problem has a sufficiently…