6 citations · 15 across the 4 of their papers we have counts for
4 papers
New lower bounds on crossing numbers of from semidefinite programming
Daniel Brosch, Sven Polak
In this paper, we use semidefinite programming and representation theory to compute new lower bounds on the crossing number of the complete bipartite graph , extending a m…
Optimizing hypergraph-based polynomials modeling job-occupancy in queueing with redundancy scheduling
Daniel Brosch, Monique Laurent, Andries Steenkamp
We investigate two classes of multivariate polynomials with variables indexed by the edges of a uniform hypergraph and coefficients depending on certain patterns of union of edges.…
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
Daniel Brosch, Etienne de Klerk
A common computational approach for polynomial optimization problems (POPs) is to use (hierarchies of) semidefinite programming (SDP) relaxations. When the variables in the POP are…
Minimum energy configurations on a toric lattice as a quadratic assignment problem
Daniel Brosch, Etienne de Klerk
We consider three known bounds for the quadratic assignment problem (QAP): an eigenvalue, a convex quadratic programming (CQP), and a semidefinite programming (SDP) bound. Since th…