Angelika Wiegele

Orcid: 0000-0003-1670-7951

Affiliations:
  • Alpen-Adria-Universität Klagenfurt, Austria


According to our database1, Angelika Wiegele authored at least 29 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Strong SDP based bounds on the cutwidth of a graph.
Comput. Oper. Res., January, 2024

2023
Partitioning through projections: Strong SDP bounds for large graph partition problems.
Comput. Oper. Res., 2023

2022
BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints.
ACM Trans. Math. Softw., 2022

An SDP-based approach for computing the stability number of a graph.
Math. Methods Oper. Res., 2022

SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering.
INFORMS J. Comput., 2022

EXPEDIS: An exact penalty method over discrete sets.
Discret. Optim., 2022

SDP-based bounds for graph partition via extended ADMM.
Comput. Optim. Appl., 2022

2021
Preface.
Math. Program., 2021

Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares.
J. Symb. Comput., 2021

Improving ADMMs for solving doubly nonnegative programs through dual factorization.
4OR, 2021

Tight SDP Relaxations for Cardinality-Constrained Problems.
Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021

2020
Security Games over Lexicographic Orders.
Proceedings of the Decision and Game Theory for Security - 11th International Conference, 2020

2019
QPLIB: a library of quadratic programming instances.
Math. Program. Comput., 2019

SDP-based branch-and-bound for non-convex quadratic integer optimization.
J. Glob. Optim., 2019

An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

BiqBin: Moving Boundaries for NP-hard Problems by HPC.
Proceedings of the Advances in High Performance Computing, 2019

2018
Using a factored dual in augmented Lagrangian methods for semidefinite programming.
Oper. Res. Lett., 2018

2017
Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation.
INFORMS J. Comput., 2017

Another pedagogy for mixed-integer Gomory.
EURO J. Comput. Optim., 2017

2016
Exact Solution Methods for the k-Item Quadratic Knapsack Problem.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems.
INFOR Inf. Syst. Oper. Res., 2015

2013
Semidefinite relaxations for non-convex quadratic mixed-integer programming.
Math. Program., 2013

2010
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations.
Math. Program., 2010

Building a Quantum Network: How to Optimize Security and Expenses.
J. Netw. Syst. Manag., 2010

Exact Algorithms for the Quadratic Linear Ordering Problem.
INFORMS J. Comput., 2010

2009
Regularization Methods for Semidefinite Programming.
SIAM J. Optim., 2009

2007
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006
A Boundary Point Method to Solve Semidefinite Programs.
Computing, 2006


  Loading...