82 citations · 86 across the 2 of their papers we have counts for
2 papers
math.CO2016★ 4 cited
Restricted completion of sparse partial Latin squares
Lina J. Andrén, Carl Johan Casselgren, Klas Markström
An partial Latin square is called -dense if each row and column has at most non-empty cells and each symbol occurs at most times in . An $n \times…
math.OC2011★ 82 cited
Exploiting symmetries in SDP-relaxations for polynomial optimization
Cordian Riener, Thorsten Theobald, Lina Jansson Andrén +1
In this paper we study various approaches for exploiting symmetries in polynomial optimization problems within the framework of semi definite programming relaxations. Our special f…