![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Angelika Wiegele
Person information
- affiliation: Alpen-Adria-Universität Klagenfurt, Austria
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Elisabeth Gaar
, Diane Puges
, Angelika Wiegele
:
Strong SDP based bounds on the cutwidth of a graph. Comput. Oper. Res. 161: 106449 (2024) - [c8]Akshay Gupte
, Melanie Siebenhofer
, Angelika Wiegele
:
Computing the Edge Expansion of a Graph Using Semidefinite Programming. ISCO 2024: 111-124 - 2023
- [j21]Frank de Meijer
, Renata Sotirov
, Angelika Wiegele, Shudian Zhao
:
Partitioning through projections: Strong SDP bounds for large graph partition problems. Comput. Oper. Res. 151: 106088 (2023) - [i2]Elisabeth Gaar, Diane Puges, Angelika Wiegele:
Strong SDP based bounds on the cutwidth of a graph. CoRR abs/2301.03900 (2023) - 2022
- [j20]Angelika Wiegele
, Shudian Zhao
:
SDP-based bounds for graph partition via extended ADMM. Comput. Optim. Appl. 82(1): 251-291 (2022) - [j19]Nicolò Gusmeroli
, Angelika Wiegele
:
EXPEDIS: An exact penalty method over discrete sets. Discret. Optim. 44(Part): 100622 (2022) - [j18]Veronica Piccialli
, Antonio Maria Sudoso
, Angelika Wiegele
:
SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering. INFORMS J. Comput. 34(4): 2144-2162 (2022) - [j17]Elisabeth Gaar
, Melanie Siebenhofer
, Angelika Wiegele
:
An SDP-based approach for computing the stability number of a graph. Math. Methods Oper. Res. 95(1): 141-161 (2022) - [j16]Nicolò Gusmeroli
, Timotej Hrga
, Borut Luzar
, Janez Povh
, Melanie Siebenhofer
, Angelika Wiegele
:
BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints. ACM Trans. Math. Softw. 48(2): 15:1-15:31 (2022) - 2021
- [j15]Martina Cerulli
, Marianna De Santis
, Elisabeth Gaar
, Angelika Wiegele
:
Improving ADMMs for solving doubly nonnegative programs through dual factorization. 4OR 19(3): 415-448 (2021) - [j14]Elisabeth Gaar
, Daniel Krenn
, Susan Margulies, Angelika Wiegele
:
Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares. J. Symb. Comput. 107: 67-105 (2021) - [j13]Leo Liberti
, Sebastian Sager
, Angelika Wiegele
:
Preface. Math. Program. 188(2): 411-419 (2021) - [c7]Angelika Wiegele
, Shudian Zhao
:
Tight SDP Relaxations for Cardinality-Constrained Problems. OR 2021: 167-172 - 2020
- [c6]Stefan Rass
, Angelika Wiegele
, Sandra König
:
Security Games over Lexicographic Orders. GameSec 2020: 422-441
2010 – 2019
- 2019
- [j12]Christoph Buchheim, Maribel Montenegro, Angelika Wiegele
:
SDP-based branch-and-bound for non-convex quadratic integer optimization. J. Glob. Optim. 73(3): 485-514 (2019) - [j11]Fabio Furini
, Emiliano Traversi, Pietro Belotti
, Antonio Frangioni
, Ambros M. Gleixner
, Nick Gould, Leo Liberti, Andrea Lodi, Ruth Misener
, Hans D. Mittelmann, Nikolaos V. Sahinidis, Stefan Vigerske, Angelika Wiegele
:
QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11(2): 237-265 (2019) - [c5]Timotej Hrga, Borut Luzar, Janez Povh, Angelika Wiegele:
BiqBin: Moving Boundaries for NP-hard Problems by HPC. HPC 2019: 327-339 - [c4]Elisabeth Gaar
, Angelika Wiegele
, Daniel Krenn
, Susan Margulies:
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture. ISSAC 2019: 155-162 - [i1]Elisabeth Gaar, Daniel Krenn, Susan Margulies, Angelika Wiegele
:
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture. CoRR abs/1901.10288 (2019) - 2018
- [j10]Marianna De Santis
, Franz Rendl
, Angelika Wiegele
:
Using a factored dual in augmented Lagrangian methods for semidefinite programming. Oper. Res. Lett. 46(5): 523-528 (2018) - 2017
- [j9]Jon Lee
, Angelika Wiegele
:
Another pedagogy for mixed-integer Gomory. EURO J. Comput. Optim. 5(4): 455-466 (2017) - [j8]Alain Billionnet, Sourour Elloumi, Amélie Lambert, Angelika Wiegele
:
Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation. INFORMS J. Comput. 29(2): 318-331 (2017) - 2016
- [c3]Christoph Buchheim
, Maribel Montenegro, Angelika Wiegele
:
A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs. ISCO 2016: 110-122 - [c2]Lucas Létocart, Angelika Wiegele
:
Exact Solution Methods for the k-Item Quadratic Knapsack Problem. ISCO 2016: 166-176 - 2015
- [j7]Elspeth Adams, Miguel F. Anjos
, Franz Rendl, Angelika Wiegele
:
A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems. INFOR Inf. Syst. Oper. Res. 53(1): 40-48 (2015) - 2013
- [j6]Christoph Buchheim
, Angelika Wiegele
:
Semidefinite relaxations for non-convex quadratic mixed-integer programming. Math. Program. 141(1-2): 435-452 (2013) - 2010
- [j5]Christoph Buchheim
, Angelika Wiegele
, Lanbo Zheng:
Exact Algorithms for the Quadratic Linear Ordering Problem. INFORMS J. Comput. 22(1): 168-177 (2010) - [j4]Stefan Rass
, Angelika Wiegele
, Peter Schartner:
Building a Quantum Network: How to Optimize Security and Expenses. J. Netw. Syst. Manag. 18(3): 283-299 (2010) - [j3]Franz Rendl, Giovanni Rinaldi
, Angelika Wiegele
:
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 121(2): 307-335 (2010)
2000 – 2009
- 2009
- [j2]Jérôme Malick, Janez Povh
, Franz Rendl, Angelika Wiegele
:
Regularization Methods for Semidefinite Programming. SIAM J. Optim. 20(1): 336-356 (2009) - 2007
- [c1]Franz Rendl, Giovanni Rinaldi, Angelika Wiegele:
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations. IPCO 2007: 295-309 - 2006
- [j1]Janez Povh
, Franz Rendl, Angelika Wiegele
:
A Boundary Point Method to Solve Semidefinite Programs. Computing 78(3): 277-286 (2006)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint