Angelika Wiegele

Available identifiers

zbMath Open wiegele.angelikaMaRDI QIDQ378111

List of research outcomes

Publication	Date of Publication	Type
Tight SDP relaxations for cardinality-constrained problems	2024-09-17	Paper
Strong SDP based bounds on the cutwidth of a graph	2023-11-15	Paper
Partitioning through projections: strong SDP bounds for large graph partition problems	2023-07-04	Paper
A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems	2023-05-09	Paper
BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints	2023-03-22	Paper
SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering	2022-09-19	Paper
\texttt{EXPEDIS}: an exact penalty method over discrete sets	2022-06-09	Paper
SDP-based bounds for graph partition via extended ADMM	2022-04-12	Paper
An SDP-based approach for computing the stability number of a graph	2022-04-08	Paper
Security games over lexicographic orders	2021-12-08	Paper
Improving ADMMs for solving doubly nonnegative programs through dual factorization	2021-11-04	Paper
Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares	2021-06-03	Paper
SOS-SDP: an Exact Solver for Minimum Sum-of-Squares Clustering	2021-04-23	Paper
BiqBin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints	2020-09-14	Paper
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture	2020-09-10	Paper
BiqBin: Moving Boundaries for NP-hard Problems by HPC	2020-09-03	Paper
Using a factored dual in augmented Lagrangian methods for semidefinite programming	2020-02-10	Paper
EXPEDIS: An Exact Penalty Method over Discrete Sets	2019-12-20	Paper
QPLIB: a library of quadratic programming instances	2019-12-19	Paper
SDP-based branch-and-bound for non-convex quadratic integer optimization	2019-05-23	Paper
Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation	2017-10-04	Paper
https://portal.mardi4nfdi.de/entity/Q2966411	2017-03-07	Paper
Exact Solution Methods for the k-Item Quadratic Knapsack Problem	2016-11-30	Paper
A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs	2016-11-30	Paper
Computational Approaches to Max-Cut	2016-04-26	Paper
Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method	2015-07-22	Paper
Semidefinite relaxations for non-convex quadratic mixed-integer programming	2013-11-11	Paper
Exact algorithms for the quadratic linear ordering problem	2012-07-28	Paper
Regularization methods for semidefinite programming	2010-03-17	Paper
Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations	2010-02-19	Paper
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations	2007-11-29	Paper
A boundary point method to solve semidefinite programs	2007-01-08	Paper
Tight SDP relaxations for cardinality-constrained problems	N/A	Paper
Computing the Edge Expansion of a Graph using SDP	N/A	Paper

Research outcomes over time

This page was built for person: Angelika Wiegele