Results 11 to 20 of about 81,686,599 (65)
Zero-one IP problems: Polyhedral descriptions & cutting plane procedures [PDF]
A systematic way for tightening an IP formulation is by employing classes of linear inequalities that define facets of the convex hull of the feasible integer points of the respective problems.
Mitra, G, Yarrow, L, Abdul-Hamid, F
core +6 more sources
Binary positive semidefinite matrices and associated integer polytopes [PDF]
We consider the positive semidefinite (psd) matrices with binary entries, along with the corresponding integer polytopes.We begin by establishing some basic properties of these matrices and polytopes.
Sorensen, M M +3 more
core +4 more sources
Discrete isoperimetric problems in spaces of constant curvature
Abstract The aim of this paper is to prove isoperimetric inequalities for simplices and polytopes with d+2$d+2$ vertices in Euclidean, spherical and hyperbolic d‐space. In particular, we find the minimal volume d‐dimensional hyperbolic simplices and spherical tetrahedra of a given inradius.
Bushra Basit, Zsolt Lángi
wiley +1 more source
General measure extensions of projection bodies
Abstract The inequalities of Petty and Zhang are affine isoperimetric‐type inequalities providing sharp bounds for Volnn−1(K)Voln(Π∘K)$\text{\rm Vol}^{n-1}_{n}(K)\text{\rm Vol}_n(\Pi ^\circ K)$, where ΠK$\Pi K$ is a projection body of a convex body K$K$.
Dylan Langharst +2 more
wiley +1 more source
Lp‐Curvature Measures and Lp,q‐Mixed Volumes
Motivated by Lutwak et al.’s Lp‐dual curvature measures, we introduce the concept of Lp‐curvature measures. This new Lp‐curvature measure is an extension of the classical surface area measure, Lp‐surface area measure, and curvature measure. In this paper, we first prove some properties of the Lp‐curvature measure.
Tongyi Ma, Raúl E. Curto
wiley +1 more source
Strengthened inequalities for the mean width and the ℓ‐norm
Abstract Barthe proved that the regular simplex maximizes the mean width of convex bodies whose John ellipsoid (maximal volume ellipsoid contained in the body) is the Euclidean unit ball; or equivalently, the regular simplex maximizes the ℓ‐norm of convex bodies whose Löwner ellipsoid (minimal volume ellipsoid containing the body) is the Euclidean unit
Károly J. Böröczky +2 more
wiley +1 more source
Sequences of Lct-Polytopes [PDF]
To r ideals on a germ of smooth variety X one attaches a rational polytope in Rr + (the LCT-polytope) that generalizes the notion of log canonical threshold in the case of one ideal.
A. Libgober (7937189) +1 more
core +6 more sources
Fractional variational problems depending on indefinite integrals [PDF]
We obtain necessary optimality conditions for variational problems with a Lagrangian depending on a Caputo fractional derivative, a fractional and an indefinite integral.
Pooseh, Shakoor +8 more
core +1 more source
Constructions of chiral polytopes of small rank [PDF]
An abstract polytope of rank n is said to be chiral if its automorphism group has precisely two orbits on the flags, such that adjacent flags belong to distinct orbits. The present paper describes a general method for deriving new finite chiral polytopes
Egon Schulte +5 more
core +1 more source
Separation algorithms for 0-1 knapsack polytopes [PDF]
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms for them, i.e., routines for detecting when they are violated.
Letchford, Adam, Kaparis, Konstantinos
core +4 more sources

