The aim of this paper is two-fold: firstly, to present subspace embedding properties for s-hashing sketching matrices, with $s\geq 1$, that are optimal in the projection dimension $m$ of the sketch, namely, $m=O(d)$, where $d$ is the dimension of the subspace. A diverse set of results are presented that address the case when the input … Read more
We consider a multiperiod stochastic capacitated facility location problem under uncertain demand and budget in each period. Using a scenario tree representation of the uncertainties, we formulate a multistage stochastic integer program to dynamically locate facilities in each period and compare it with a two-stage approach that determines the facility locations up front. In the … Read more
We consider variational inequalities governed by strongly pseudomonotone vec- tor fields on Hadamard manifolds. The existence and uniqueness results of the solution, linear convergence, error estimates and finite convergence for sequences generated by a mod- ified projection method for solving variational inequalities are investigated. Some examples and numerical experiments are also given to illustrate our … Read more
MIMO radar plays a key role in autonomous driving, and the similarity waveform constraint is an important constraint for radar waveform design. However, the joint constant-modulus and similarity constraint is a difficult constraint. Only the special case with $\infty$-norm similarity and constant-modulus constraints is tackled by the semidefinite relaxation (SDR) and the successive quadratic refinement … Read more
Binary polynomial optimization is equivalent to the problem of minimizing a linear function over the intersection of the multilinear set with a polyhedron. Many families of valid inequalities for the multilinear set are available in the literature, though giving a polyhedral characterization of the convex hull is not tractable in general as binary polynomial optimization … Read more
A small polygon is a polygon of unit diameter. The maximal perimeter of a convex equilateral small polygon with $n=2^s$ vertices is not known when $s \ge 4$. In this paper, we construct a family of convex equilateral small $n$-gons, $n=2^s$ and $s \ge 4$, and show that their perimeters are within $\pi^4/n^4 + O(1/n^5)$ … Read more
We propose tight conditions under which two-stage robust and distributionally robust optimization problems are optimally solved in affine decision rules. Contrary to previous work, our conditions do not impose any structure on the support of the uncertain problem parameters, and they ensure point-wise (as opposed to worst-case) optimality of affine decision rules. The absence of … Read more
A total coloring of a graph G = (V, E) is an assignment of colors to vertices and edges such that neither two adjacent vertices nor two incident edges get the same color, and, for each edge, the end-points and the edge itself receive different colors. Any valid total coloring induces a partition of the … Read more
Crowd-shipping is an emergent solution to avoid the negative effects caused by the growing demand for last-mile delivery services. Previous research has studied crowd-shipping typically at an operational planning level. However, the study of support infrastructure within a city logistics framework has been neglected, especially from a strategic perspective. We investigate a crowd-sourced last-mile parcel … Read more
The aim of this letter is to design and computationally test several improvements for the compact integer linear programming (ILP) formulations of the temporal bin packing problem with fire-ups (TBPP-FU). This problem is a challenging generalization of the classical bin packing problem in which the items, interpreted as jobs of given weight, are active only … Read more