155 citations · 967 across the 61 of their papers we have counts for
4 papers · 1 filter
Block-diagonal semidefinite programming hierarchies for 0/1 programming
N. Gvozdenovic, M. Laurent, F. Vallentin
Lovasz and Schrijver, and later Lasserre, proposed hierarchies of semidefinite programming relaxations for general 0/1 linear programming problems. In this paper these two construc…
The isodiametric problem with lattice-point constraints
M. A. Hernandez Cifre, A. Schuermann, F. Vallentin
In this paper, the isodiametric problem for centrally symmetric convex bodies in the Euclidean d-space R^d containing no interior non-zero point of a lattice L is studied. It is sh…
Optimality and uniqueness of the (4,10,1/6) spherical code
Christine Bachoc, Frank Vallentin
Linear programming bounds provide an elegant method to prove optimality and uniqueness of an (n,N,t) spherical code. However, this method does not apply to the parameters (4,10,1/6…
Symmetry in semidefinite programs
Frank Vallentin
This paper is a tutorial in a general and explicit procedure to simplify semidefinite programs which are invariant under the action of a symmetry group. The procedure is based on b…