Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Brosch, Daniel"'
Autor:
Brosch, Daniel, Puges, Diane
The inducibility of a graph represents its maximum density as an induced subgraph over all possible sequences of graphs of size growing to infinity. This invariant of graphs has been extensively studied since its introduction in $1975$ by Pippenger a
Externí odkaz:
http://arxiv.org/abs/2404.12838
Autor:
Brosch, Daniel, Polak, Sven
In this paper, we use semidefinite programming and representation theory to compute new lower bounds on the crossing number of the complete bipartite graph $K_{m,n}$, extending a method from de Klerk et al. [SIAM J. Discrete Math. 20 (2006), 189--202
Externí odkaz:
http://arxiv.org/abs/2206.02755
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. These polynomials arise naturally to model job-occupancy in some queu
Externí odkaz:
http://arxiv.org/abs/2009.04510
Autor:
Brosch, Daniel, de Klerk, Etienne
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 required to be nonnegative, these SDP problems typically involve nonn
Externí odkaz:
http://arxiv.org/abs/2001.11348
Autor:
Brosch, Daniel, de Klerk, Etienne
Publikováno v:
Discrete Optimization, 2020, 100612, ISSN 1572-5286
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 the last two bounds were not compared directly before, we prove that the
Externí odkaz:
http://arxiv.org/abs/1908.00872
Autor:
Brosch, Daniel1,2 (AUTHOR), C. Polak, Sven2,3 (AUTHOR) s.c.polak@tilburguniversity.edu
Publikováno v:
Mathematical Programming. Sep2024, Vol. 207 Issue 1/2, p693-715. 23p.
Autor:
Brosch, Daniel1 (AUTHOR) D.Brosch@tilburguniversity.edu, de Klerk, Etienne1 (AUTHOR)
Publikováno v:
Optimization Methods & Software. Dec2022, Vol. 37 Issue 6, p2001-2020. 20p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Brosch, Daniel
This dissertation explores different approaches to and applications of symmetry reduction in convex optimization. Using tools from semidefinite programming, representation theory and algebraic combinatorics, hard combinatorial problems are solved or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f5cad31cc92b7d90909d3445fc13546
https://www.danielbrosch.com/thesis
https://www.danielbrosch.com/thesis