| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6123968 | 2024-04-08 | Paper |
| Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems | 2023-07-12 | Paper |
| A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems | 2023-05-09 | Paper |
| Stable-Set and Coloring bounds based on 0-1 quadratic optimization | 2022-11-23 | Paper |
| In memoriam: Gerhard Woeginger (1964--2022) | 2022-11-04 | Paper |
| Quantum Annealing versus Digital Computing | 2022-09-06 | Paper |
| Combining semidefinite and polyhedral relaxations for integer programs | 2022-08-30 | Paper |
| In memoriam Gerhard Woeginger (1964--2022) | 2022-07-22 | Paper |
| Lower bounds for the bandwidth problem | 2022-03-09 | Paper |
| A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring | 2020-08-28 | Paper |
| Regularization of inverse problems via box constrained minimization | 2020-06-04 | Paper |
| Using a factored dual in augmented Lagrangian methods for semidefinite programming | 2020-02-10 | Paper |
| A bundle approach for SDPs with exact subgraph constraints | 2020-02-06 | Paper |
| Lower Bounds for the Bandwidth Problem | 2019-04-14 | Paper |
| Quadratic knapsack relaxations using cutting planes and semidefinite programming | 2019-01-11 | Paper |
| Regularization of inverse problems via box constrained minimization | 2018-07-30 | Paper |
| Computing quasisolutions of nonlinear inverse problems via efficient minimization of trust region problems | 2016-10-04 | Paper |
| Computational Approaches to Max-Cut | 2016-04-26 | Paper |
| A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds | 2015-09-09 | Paper |
| The spectral bundle method with second-order information | 2014-10-29 | Paper |
| Bandwidth, Vertex Separators, and Eigenvalue Optimization | 2013-09-13 | Paper |
| Semidefinite relaxations of ordering problems | 2013-08-12 | Paper |
| A computational study and survey of methods for the single-row facility layout problem | 2013-07-19 | Paper |
| Matrix Relaxations in Combinatorial Optimization | 2012-07-10 | Paper |
| Quadratic factorization heuristics for copositive programming | 2011-06-08 | Paper |
| Semidefinite Relaxations for Integer Programming | 2010-06-03 | Paper |
| Regularization Methods for Semidefinite Programming | 2010-03-17 | Paper |
| Copositive programming motivated bounds on the stability and the chromatic numbers | 2010-02-19 | Paper |
| Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations | 2010-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3656591 | 2010-01-13 | Paper |
| Copositive and semidefinite relaxations of the quadratic assignment problem | 2009-08-19 | Paper |
| An Augmented Primal-Dual Method for Linear Conic Programs | 2009-05-27 | Paper |
| A Copositive Programming Approach to Graph Partitioning | 2008-02-25 | Paper |
| A semidefinite programming-based heuristic for graph coloring | 2008-01-21 | Paper |
| A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations | 2007-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5292090 | 2007-06-19 | Paper |
| Semidefinite programming relaxations for graph coloring and maximal clique problems | 2007-03-05 | Paper |
| Bounds for the quadratic assignment problem using the bundle method | 2007-03-05 | Paper |
| A boundary point method to solve semidefinite programs | 2007-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5482470 | 2006-08-28 | Paper |
| Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition | 2006-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4674151 | 2005-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4674154 | 2005-05-09 | Paper |
| Computational Experience with Stable Set Relaxations | 2004-01-19 | Paper |
| Graph partitioning using linear and semidefinite programming | 2003-10-29 | Paper |
| Solving Graph Bisection Problems with Semidefinite Programming | 2003-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414639 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3147670 | 2003-04-22 | Paper |
| The Gauss-Newton direction in semidefinite programming | 2002-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547452 | 2002-08-21 | Paper |
| The Stock Size Problem | 2002-07-01 | Paper |
| Towards a characterisation of Pfaffian near bipartite graphs | 2002-05-21 | Paper |
| Computational experience with ill-posed problems in semidefinite programming | 2002-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712302 | 2001-05-06 | Paper |
| Semidefinite programming and combinatorial optimization | 2001-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517107 | 2000-11-23 | Paper |
| A semidefinite programming approach to the quadratic knapsack problem | 2000-10-30 | Paper |
| A Spectral Bundle Method for Semidefinite Programming | 2000-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945404 | 2000-09-26 | Paper |
| Semidefinite programs and association schemes | 2000-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234139 | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234142 | 1999-09-15 | Paper |
| Solving quadratic (0,1)-problems by semidefinite programs and cutting planes | 1999-06-03 | Paper |
| Semidefinite programming relaxations for the quadratic assignment problem | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840376 | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400639 | 1998-08-02 | Paper |
| Connection between semidefinite relaxations of the max-cut and stable set problems | 1998-06-08 | Paper |
| A semidefinite framework for trust region subproblems with applications to large scale minimization | 1997-11-25 | Paper |
| QAPLIB - a quadratic assignment problem library | 1997-07-23 | Paper |
| Lower bounds for the quadratic assignment problem via triangle decompositions | 1996-09-30 | Paper |
| An Interior-Point Method for Semidefinite Programming | 1996-09-22 | Paper |
| A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming | 1996-08-19 | Paper |
| Solving the max-cut problem using eigenvalues | 1996-05-30 | Paper |
| A projection technique for partitioning the nodes of a graph | 1996-01-07 | Paper |
| A spectral approach to bandwidth and separator problems in graphs | 1995-12-11 | Paper |
| Nonpolyhedral Relaxations of Graph-Bisection Problems | 1995-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4321546 | 1995-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4321556 | 1995-02-16 | Paper |
| A computational study of graph partitioning | 1994-12-11 | Paper |
| Reconstructing sets of orthogonal line segments in the plane | 1994-02-07 | Paper |
| A New Lower Bound Via Projection for the Quadratic Assignment Problem | 1993-01-17 | Paper |
| Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality | 1992-07-22 | Paper |
| Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem | 1992-06-28 | Paper |
| Lexicographic bottleneck problems | 1992-06-27 | Paper |
| Color constrained combinatorial optimization problems | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3978111 | 1992-06-25 | Paper |
| QAPLIB-A quadratic assignment problem library | 1991-01-01 | Paper |
| Constrained spanning trees and the traveling salesman problem | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3826614 | 1989-01-01 | Paper |
| On the Euclidean assignment problem | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3747197 | 1987-01-01 | Paper |
| Minimizing the density of terminal assignments in layout design | 1986-01-01 | Paper |
| A thermodynamically motivated simulation procedure for combinatorial optimization problems | 1984-01-01 | Paper |
| A Class of New Cutting Planes for SDP Relaxations of Stable Set and Coloring Problems | 0001-01-03 | Paper |
