| Publication | Date of Publication | Type |
|---|
| D-Optimal Data Fusion: Exact and Approximation Algorithms | 2024-03-26 | Paper |
| Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs | 2024-03-01 | Paper |
| On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem | 2024-02-28 | Paper |
| An outer-approximation algorithm for maximum-entropy sampling | 2024-02-27 | Paper |
| An outer-approximation algorithm for maximum-entropy sampling | 2023-08-03 | Paper |
| Tridiagonal maximum-entropy sampling and tridiagonal masks | 2023-06-15 | Paper |
| On The Boolean Quadric Forest Polytope | 2023-05-05 | Paper |
| Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions | 2023-01-23 | Paper |
| Trading off \(1\)-norm and sparsity against rank for linear models using mathematical optimization: \(1\)-norm minimizing partially reflexive ah-symmetric generalized inverses | 2022-08-20 | Paper |
| Gaining or losing perspective | 2022-04-11 | Paper |
| Gaining or Losing Perspective for Convex Multivariate Functions on a Simplex | 2022-01-18 | Paper |
| Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions | 2021-12-08 | Paper |
| Experimental analysis of local searches for sparse reflexive generalized inverses | 2021-11-26 | Paper |
| Mixing convex-optimization bounds for maximum-entropy sampling | 2021-08-11 | Paper |
| Convexification of bilinear forms through non-symmetric lifting | 2021-08-11 | Paper |
| Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search | 2021-07-20 | Paper |
| Masking Anstreicher's linx bound for improved entropy bounds | 2021-06-05 | Paper |
| Handling separable non-convexities using disjunctive cuts | 2021-02-04 | Paper |
| Improving proximity bounds using sparsity | 2021-02-04 | Paper |
| On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs | 2020-04-27 | Paper |
| On an SDP relaxation for kissing number | 2020-04-27 | Paper |
| Volume computation for sparse Boolean quadric relaxations | 2020-02-20 | Paper |
| Approximating max-cut under graph-MSO constraints | 2020-02-10 | Paper |
| On sparse reflexive generalized inverse | 2020-02-10 | Paper |
| On Proximity for k-Regular Mixed-Integer Linear Optimization | 2020-02-07 | Paper |
| Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization | 2019-10-29 | Paper |
| More Virtuous Smoothing | 2019-05-07 | Paper |
| Continuous relaxations for Constrained Maximum-Entropy Sampling | 2019-01-11 | Paper |
| On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation | 2018-12-21 | Paper |
| Approximating graph-constrained max-cut | 2018-10-26 | Paper |
| Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations | 2018-07-13 | Paper |
| Computing with an algebraic-perturbation variant of Barvinok's algorithm | 2018-04-04 | Paper |
| On global optimization with indefinite quadratics | 2018-03-28 | Paper |
| Efficient treatment of bilinear forms in global optimization | 2018-03-20 | Paper |
| Virtuous smoothing for global optimization | 2017-12-07 | Paper |
| Quantifying Double McCormick | 2017-12-07 | Paper |
| Experimental validation of volume-based comparison for double-McCormick relaxations | 2017-08-04 | Paper |
| An overview of exact algorithms for the Euclidean Steiner tree problem inn-space | 2016-10-21 | Paper |
| An algebraic-perturbation variant of Barvinok's algorithm | 2016-10-17 | Paper |
| A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space | 2016-09-26 | Paper |
| Max-Cut Under Graph Constraints | 2016-08-10 | Paper |
| Sparse pseudoinverses via LP and SDP relaxations of Moore-Penrose | 2016-06-22 | Paper |
| On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond | 2015-12-11 | Paper |
| Weak orientability of matroids and polynomial equations | 2015-08-19 | Paper |
| On the Composition of Convex Envelopes for Quadrilinear Terms | 2015-03-30 | Paper |
| On branching rules for convex mixed-integer nonlinear optimization | 2015-03-16 | Paper |
| Non-monotone submodular maximization under matroid and knapsack constraints | 2015-02-04 | Paper |
| Optimal rank-sparsity decomposition | 2015-01-15 | Paper |
| On the optimal design of water distribution networks: a practical MINLP approach | 2014-08-20 | Paper |
| Matroid matching | 2014-08-13 | Paper |
| On the number of realizations of certain Henneberg graphs arising in protein conformation | 2014-05-05 | Paper |
| Computation in multicriteria matroid optimization | 2014-04-01 | Paper |
| Techniques for Submodular Maximization | 2013-09-13 | Paper |
| Matroid Matching: The Power of Local Search | 2013-07-04 | Paper |
| A matroid view of key theorems for edge-swapping algorithms | 2013-02-20 | Paper |
| The quadratic Graver cone, quadratic integer minimization, and extensions | 2012-12-19 | Paper |
| Discretization orders for distance geometry problems | 2012-11-30 | Paper |
| An Algorithmic Framework for MINLP with Separable Non-Convexity | 2012-07-10 | Paper |
| A Polytope for a Product of Real Linear Functions in 0/1 Variables | 2012-07-10 | Paper |
| On a Binary-Encoded ILP Coloring Formulation | 2012-06-18 | Paper |
| Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations | 2011-12-14 | Paper |
| Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz | 2011-12-07 | Paper |
| On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem | 2011-08-12 | Paper |
| A Probing Algorithm for MINLP with Failure Prediction by SVM | 2011-05-26 | Paper |
| Intractability of approximate multi-dimensional nonlinear optimization on independence systems | 2011-05-06 | Paper |
| Submodular Maximization over Multiple Matroids via Generalized Exchange Properties | 2011-04-27 | Paper |
| Feasibility-Based Bounds Tightening via Fixed Points | 2011-01-08 | Paper |
| Approximate Nonlinear Optimization over Weighted Independence Systems | 2010-12-03 | Paper |
| Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints | 2010-12-03 | Paper |
| Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization | 2010-10-14 | Paper |
| On convex relaxations of quadrilinear terms | 2010-10-06 | Paper |
| Parametric nonlinear discrete optimization over well-described sets and matroid intersections | 2010-09-16 | Paper |
| Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations | 2010-09-16 | Paper |
| Nonlinear Integer Programming | 2010-06-03 | Paper |
| Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz – Corrigendum | 2010-04-23 | Paper |
| Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz | 2010-04-22 | Paper |
| A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity | 2009-10-29 | Paper |
| Submodular Maximization over Multiple Matroids via Generalized Exchange Properties | 2009-10-28 | Paper |
| Branching and bounds tighteningtechniques for non-convex MINLP | 2009-09-18 | Paper |
| Nonlinear Matroid Optimization and Experimental Design | 2009-08-20 | Paper |
| Nonlinear Optimization over a Weighted Independence System | 2009-07-02 | Paper |
| On test sets for nonlinear integer maximization | 2009-03-04 | Paper |
| Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility | 2009-01-20 | Paper |
| An algorithmic framework for convex mixed integer nonlinear programs | 2008-10-29 | Paper |
| Nonlinear optimization for matroid intersection and extensions | 2008-07-24 | Paper |
| Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs | 2008-06-10 | Paper |
| An MINLP Solution Method for a Water Network Problem | 2008-03-11 | Paper |
| Comparison of the Two Formulations of w-u-v and w-F in Nonlinear Plate Analysis | 2007-06-01 | Paper |
| Solving maximum-entropy sampling problems using factored masks | 2007-03-05 | Paper |
| In situ column generation for a cutting-stock problem | 2007-02-26 | Paper |
| Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem | 2006-03-07 | Paper |
| Parsimonious binary-encoding in integer programming | 2006-01-09 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Min-up/min-down polytopes | 2005-08-22 | Paper |
| Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation | 2005-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4821529 | 2004-10-13 | Paper |
| A linear integer programming bound for maximum-entropy sampling | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4429166 | 2003-09-24 | Paper |
| Cropped cubes | 2003-08-28 | Paper |
| Constrained Maximum-Entropy Sampling | 2003-05-05 | Paper |
| All-different polytopes | 2002-08-20 | Paper |
| Maximum-entropy remote sampling | 2001-06-19 | Paper |
| Polyhedral methods for piecewise-linear functions. I: The lambda method | 2001-06-14 | Paper |
| Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems | 2001-02-09 | Paper |
| A characterization of the orientations of ternary matroids | 2000-06-25 | Paper |
| Orienting matroids representable over both GF(3) and GF(5) | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247165 | 1999-10-17 | Paper |
| On the Boolean-quadric packing uncapacitated facility-location polytope | 1999-05-05 | Paper |
| The volume of relaxed Boolean-quadric and cut polytopes | 1997-06-09 | Paper |
| Classroom Note:Hoffman's Circle Untangled | 1997-05-19 | Paper |
| An Exact Algorithm for Maximum Entropy Sampling | 1997-03-11 | Paper |
| Block matrices and multispherical structure of distance matrices | 1997-02-11 | Paper |
| More facets from fences for linear ordering and acyclic subgraph polytopes | 1995-08-01 | Paper |
| Geometric comparison of combinatorial polytopes | 1994-12-01 | Paper |
| Local bipartite turán graphs and graph partitioning | 1994-05-10 | Paper |
| Order selection on a single machine with high set-up costs | 1993-12-20 | Paper |
| A comparison of two edge-coloring formulations | 1993-11-28 | Paper |
| Classification of two-person ordinal bimatrix games | 1993-02-14 | Paper |
| On Constrained Bottleneck Extrema | 1993-01-17 | Paper |
| Crashing a maximum-weight complementary basis | 1993-01-16 | Paper |
| Matroid Applications and Algorithms | 1992-08-13 | Paper |
| A spectral method for concordant polyhedral faces | 1992-06-27 | Paper |
| Characterizations of the Dimension for Classes of Concordant Polytopes | 1990-01-01 | Paper |
| A spectral approach to polyhedral dimension | 1990-01-01 | Paper |
| Canonical equation sets for classes of concordant polytopes | 1990-01-01 | Paper |
| The incidence structure of subspaces with well-scaled frames | 1990-01-01 | Paper |
| Turán's triangle theorem and binary matroids | 1989-01-01 | Paper |
| Subspaces with well-scaled frames | 1989-01-01 | Paper |
