Angelika Wiegele
Orcid: 0000-0003-1670-7951Affiliations:
- Alpen-Adria-Universität Klagenfurt, Austria
According to our database1,
Angelika Wiegele
authored at least 30 papers
between 2006 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on scopus.com
-
on orcid.org
-
on wwwu.aau.at
On csauthors.net:
Bibliography
2024
Comput. Oper. Res., January, 2024
Proceedings of the Combinatorial Optimization - 8th International Symposium, 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
Math. Methods Oper. Res., 2022
INFORMS J. Comput., 2022
2021
Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares.
J. Symb. Comput., 2021
4OR, 2021
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
Proceedings of the Decision and Game Theory for Security - 11th International Conference, 2020
2019
J. Glob. Optim., 2019
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019
Proceedings of the Advances in High Performance Computing, 2019
2018
Oper. Res. Lett., 2018
2017
Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation.
INFORMS J. Comput., 2017
2016
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
Math. Program., 2013
2010
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations.
Math. Program., 2010
J. Netw. Syst. Manag., 2010
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