-
Notifications
You must be signed in to change notification settings - Fork 0
/
CITATION.bib
12 lines (12 loc) · 1.14 KB
/
CITATION.bib
1
2
3
4
5
6
7
8
9
10
11
12
@phdthesis{Brosch2022,
abstract = {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 bounded. The first chapters consider the Jordan reduction method, extend the method to optimization over the doubly nonnegative cone, and apply it to quadratic assignment problems and energy minimization on a discrete torus. The following chapter uses symmetry reduction as a proving tool, to approach a problem from queuing theory with redundancy scheduling. The final chapters propose generalizations and reductions of flag algebras, a powerful tool for problems coming from extremal combinatorics.},
author = {Daniel Brosch},
doi = {10.26116/12v4-k024},
isbn = {978 90 5668 690 1},
language = {English},
publisher = {CentER, Center for Economic Research},
school = {Tilburg University},
series = {CentER Dissertation Series},
title = {Symmetry reduction in convex optimization with applications in combinatorics},
year = {2022}
}