A Boundary Point Method to Solve Semidefinite Programs. - Janez Povh; Franz Rendl; Angelika Wiegele (Computing, 2006)

A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations. - Franz Rendl; Giovanni Rinaldi; Angelika Wiegele (IPCO, 2007)

Regularization Methods for Semidefinite Programming. - Jérôme Malick; Janez Povh; Franz Rendl; Angelika Wiegele (SIAM J. Optim., 2009)

Exact Algorithms for the Quadratic Linear Ordering Problem. - Christoph Buchheim; Angelika Wiegele; Lanbo Zheng (INFORMS J. Comput., 2010)

Building a Quantum Network: How to Optimize Security and Expenses. - Stefan Rass; Angelika Wiegele; Peter Schartner (J. Netw. Syst. Manag., 2010)

Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. - Franz Rendl; Giovanni Rinaldi; Angelika Wiegele (Math. Program., 2010)

Semidefinite relaxations for non-convex quadratic mixed-integer programming. - Christoph Buchheim; Angelika Wiegele (Math. Program., 2013)

A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems. - Elspeth Adams; Miguel F. Anjos; Franz Rendl; Angelika Wiegele (INFOR Inf. Syst. Oper. Res., 2015)

A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs. - Christoph Buchheim; Maribel Montenegro; Angelika Wiegele (ISCO, 2016)

Exact Solution Methods for the k-Item Quadratic Knapsack Problem. - Lucas Létocart; Angelika Wiegele (ISCO, 2016)

Another pedagogy for mixed-integer Gomory. - Jon Lee 001; Angelika Wiegele (EURO J. Comput. Optim., 2017)

Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation. - Alain Billionnet; Sourour Elloumi; Amélie Lambert; Angelika Wiegele (INFORMS J. Comput., 2017)

Using a factored dual in augmented Lagrangian methods for semidefinite programming. - Marianna De Santis; Franz Rendl; Angelika Wiegele (Oper. Res. Lett., 2018)

BiqBin: Moving Boundaries for NP-hard Problems by HPC. - Timotej Hrga; Borut Luzar; Janez Povh; Angelika Wiegele (HPC, 2019)

An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture. - Elisabeth Gaar; Angelika Wiegele; Daniel Krenn; Susan Margulies (ISSAC, 2019)

SDP-based branch-and-bound for non-convex quadratic integer optimization. - Christoph Buchheim; Maribel Montenegro; Angelika Wiegele (J. Glob. Optim., 2019)

QPLIB: a library of quadratic programming instances. - Fabio Furini; Emiliano Traversi; Pietro Belotti; Antonio Frangioni; Ambros M. Gleixner; Nick Gould; Leo Liberti; Andrea Lodi 001; Ruth Misener; Hans D. Mittelmann; Nikolaos V. Sahinidis; Stefan Vigerske; et al. (Math. Program. Comput., 2019)

Security Games over Lexicographic Orders. - Stefan Rass; Angelika Wiegele; Sandra König (GameSec, 2020)

Tight SDP Relaxations for Cardinality-Constrained Problems. - Angelika Wiegele; Shudian Zhao (OR, 2021)

Improving ADMMs for solving doubly nonnegative programs through dual factorization. - Martina Cerulli; Marianna De Santis; Elisabeth Gaar; Angelika Wiegele (4OR, 2021)

Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares. - Elisabeth Gaar; Daniel Krenn; Susan Margulies; Angelika Wiegele (J. Symb. Comput., 2021)

Preface. - Leo Liberti; Sebastian Sager; Angelika Wiegele (Math. Program., 2021)

SDP-based bounds for graph partition via extended ADMM. - Angelika Wiegele; Shudian Zhao (Comput. Optim. Appl., 2022)

EXPEDIS: An exact penalty method over discrete sets. - Nicolò Gusmeroli; Angelika Wiegele (Discret. Optim., 2022)

SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering. - Veronica Piccialli; Antonio Maria Sudoso; Angelika Wiegele (INFORMS J. Comput., 2022)

An SDP-based approach for computing the stability number of a graph. - Elisabeth Gaar; Melanie Siebenhofer; Angelika Wiegele (Math. Methods Oper. Res., 2022)

BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints. - Nicolò Gusmeroli; Timotej Hrga; Borut Luzar; Janez Povh; Melanie Siebenhofer; Angelika Wiegele (ACM Trans. Math. Softw., 2022)

Partitioning through projections: Strong SDP bounds for large graph partition problems. - Frank de Meijer; Renata Sotirov; Angelika Wiegele; Shudian Zhao (Comput. Oper. Res., 2023)

Computing the Edge Expansion of a Graph Using Semidefinite Programming. - Akshay Gupte; Melanie Siebenhofer; Angelika Wiegele (ISCO, 2024)

Strong SDP based bounds on the cutwidth of a graph. - Elisabeth Gaar; Diane Puges; Angelika Wiegele (Comput. Oper. Res., 2024)