| Publication | Date of Publication | Type |
|---|
| Quantum Annealing versus Digital Computing | 2022-09-06 | Paper |
| Optimal patchings for consecutive ones matrices | 2022-04-14 | Paper |
| Computational Approaches to Max-Cut | 2016-04-26 | Paper |
| Lifting and separation procedures for the cut polytope | 2014-08-29 | Paper |
| Exact ground states of two-dimensional \(\pm J\) Ising spin glasses | 2013-04-10 | Paper |
| SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances | 2012-12-19 | Paper |
| Traces of the XII Aussois Workshop on combinatorial optimization | 2010-09-16 | Paper |
| Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations | 2010-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3181648 | 2009-10-12 | Paper |
| Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case | 2008-12-05 | Paper |
| The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation | 2008-05-27 | Paper |
| A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations | 2007-11-29 | Paper |
| Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm | 2006-08-23 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| New approaches for optimizing over the semimetric polytope | 2005-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465110 | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668573 | 2005-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828942 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829031 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4735939 | 2004-08-09 | Paper |
| On the cut polyhedron. | 2004-03-14 | Paper |
| Minimizing breaks by maximizing cuts. | 2003-08-13 | Paper |
| Primal separation for 0/1 polytopes | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411388 | 2003-07-08 | Paper |
| The mathematics of playing golf, or: A new class of difficult nonlinear mixed integer programs | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532225 | 2002-01-01 | Paper |
| Practical performance of efficient minimum cut algorithms | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398370 | 1998-07-19 | Paper |
| The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities | 1997-06-30 | Paper |
| A branch-and-cut algorithm for the equicut problem | 1997-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4845366 | 1996-03-05 | Paper |
| The graphical relaxation: A new framework for the symmetric traveling salesman polytope | 1993-06-29 | Paper |
| The Crown Inequalities for the Symmetric Traveling Salesman Polytope | 1993-01-16 | Paper |
| The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities | 1992-06-27 | Paper |
| A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems | 1991-01-01 | Paper |
| Facet identification for the symmetric traveling salesman polytope | 1990-01-01 | Paper |
| Scheduling tasks with sequence-dependent processing times | 1988-01-01 | Paper |
| Branch-and-cut approach to a variant of the traveling salesman problem | 1988-01-01 | Paper |
| A function space approach to the foundations of system theory | 1983-01-01 | Paper |
