This paper presents an improved lower bound and an approximation algorithm based on
spectral decomposition for the binary constrained quadratic programming problem. To …

… The permutahedron Pn is a zonotope, and it can be represented as the Minkowski sum of
all coordinate 1-simplices ∆ij for 1 ≤ i<j ≤ n. Using our established notation, we write Pn = Pn({…

Le principal objectif de cet article est de proposer une méthodologie pour détecter des défauts
sur des systèmes incertains. Dans ce papier, les incertitudes sont considérées comme …

In this paper an algorithm for nonlinear explicit model predictive control is introduced based
on multiresolution function approximation that returns a low complexity approximate …

We present a connection between the viability kernel and maximal reachable sets. Current
numerical schemes that compute the viability kernel suffer from a complexity that is …

… Zonotopes Support Functions … ● Matisse Toolbox: zonotopes …

… r ) and can be solved efficiently using theory of zonotopes, hyperplane arrangements and
linear programming [Avis, Fukuda]. …

… We observe that there is a correspondence between spatial zonotopes and line planar
line arrangements. Thus, we can map the problem of computing the faces of the convex …

We construct the moduli spaces of tropical curves and tropical principally polarized abelian
varieties, working in the category of (what we call) stacky fans. We define the tropical Torelli …

Polytopes are a classical object of convex geometry. They play a key role in many modern
fields of research, such as algebraic and symplectic geometry, toric geometry and toric …