The following pages link to Angelika Wiegele (Q378111):
Displaying 35 items.
- Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- A boundary point method to solve semidefinite programs (Q858180) (← links)
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005) (← links)
- Security games over lexicographic orders (Q2056964) (← links)
- An SDP-based approach for computing the stability number of a graph (Q2123126) (← links)
- SDP-based bounds for graph partition via extended ADMM (Q2125076) (← links)
- Improving ADMMs for solving doubly nonnegative programs through dual factorization (Q2240675) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Using a factored dual in augmented Lagrangian methods for semidefinite programming (Q2294228) (← links)
- SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
- \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs (Q2835666) (← links)
- Exact Solution Methods for the k-Item Quadratic Knapsack Problem (Q2835673) (← links)
- Exact algorithms for the quadratic linear ordering problem (Q2899047) (← links)
- (Q2966411) (← links)
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412) (← links)
- BiqBin: Moving Boundaries for NP-hard Problems by HPC (Q5119114) (← links)
- An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture (Q5120487) (← links)
- Regularization Methods for Semidefinite Programming (Q5189563) (← links)
- Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method (Q5265177) (← links)
- Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation (Q5364279) (← links)
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations (Q5429275) (← links)
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) (← links)
- Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems (Q6160119) (← links)
- EXPEDIS: An Exact Penalty Method over Discrete Sets (Q6331500) (← links)
- SOS-SDP: an Exact Solver for Minimum Sum-of-Squares Clustering (Q6365959) (← links)
- Tight SDP relaxations for cardinality-constrained problems (Q6505154) (← links)
- Computing the Edge Expansion of a Graph using SDP (Q6525101) (← links)
- Tight SDP relaxations for cardinality-constrained problems (Q6606656) (← links)
- Connectivity via convexity: Bounds on the edge expansion in graphs (Q6747352) (← links)
- Spanning and Splitting: Integer Semidefinite Programming for the Quadratic Minimum Spanning Tree Problem (Q6747662) (← links)
