| Publication | Date of Publication | Type |
|---|
| Sub-exponential lower bounds for branch-and-bound with general disjunctions via interpolation | 2024-11-28 | Paper |
| Ambiguities in DoA estimation with linear arrays | 2024-09-12 | Paper |
| Enabling research through the SCIP Optimization Suite 8.0 | 2024-09-10 | Paper |
| On computing small variable disjunction branch-and-bound trees | 2024-08-20 | Paper |
| Reduction of Potential-Based Flow Networks | 2024-03-01 | Paper |
| Combinatorial acyclicity models for potential‐based flows | 2023-12-11 | Paper |
| The Impact of Symmetry Handling for the Stable Set Problem via Schreier-Sims Cuts | 2023-11-10 | Paper |
| Handling symmetries in mixed-integer semidefinite programs | 2023-10-04 | Paper |
| Sub-Exponential Lower Bounds for Branch-and-Bound with General Disjunctions via Interpolation | 2023-08-08 | Paper |
| Physics informed neural networks: a case study for gas transport problems | 2023-04-26 | Paper |
| On the robustness of potential-based flow networks | 2023-03-14 | Paper |
| Enabling Research through the SCIP Optimization Suite 8.0 | 2023-03-13 | Paper |
| Recovery under side constraints | 2022-12-14 | Paper |
| Capacity evaluation for large-scale gas networks | 2022-10-25 | Paper |
| Packing Under Convex Quadratic Constraints | 2022-10-14 | Paper |
| On the complexity of finding shortest variable disjunction branch-and-bound proofs | 2022-08-16 | Paper |
| Estimating the Size of Branch-and-Bound Trees | 2022-06-30 | Paper |
| Identification of model uncertainty via optimal design of experiments applied to a mechanical press | 2022-05-11 | Paper |
| Optimal patchings for consecutive ones matrices | 2022-04-14 | Paper |
| Packing under convex quadratic constraints | 2022-03-22 | Paper |
| The SCIP Optimization Suite 8.0 | 2021-12-16 | Paper |
| Schreier-Sims Cuts meet Stable Set: Preserving Problem Structure when Handling Symmetries | 2021-11-15 | Paper |
| Block-sparse recovery of semidefinite systems and generalized null space conditions | 2020-08-28 | Paper |
| Sparse recovery with integrality constraints | 2020-06-29 | Paper |
| Semi-automatically optimized calibration of internal combustion engines | 2020-03-04 | Paper |
| On the structure of linear programs with overlapping cardinality constraints | 2020-02-20 | Paper |
| Sparsity of integer formulations for binary programs | 2020-02-10 | Paper |
| Global Optimization of Mixed-Integer ODE Constrained Network Problems Using the Example of Stationary Gas Transport | 2019-12-09 | Paper |
| Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials | 2019-11-15 | Paper |
| Maximizing the storage capacity of gas networks: a global MINLP approach | 2019-10-29 | Paper |
| Algorithmic results for potential‐based flows: Easy and hard cases | 2019-07-30 | Paper |
| On the complexity of instationary gas flows | 2019-06-11 | Paper |
| Irreducible infeasible subsystems of semidefinite systems | 2019-06-07 | Paper |
| Polytopes associated with symmetry handling | 2019-05-17 | Paper |
| A computational comparison of symmetry handling methods for mixed integer programs | 2019-05-03 | Paper |
| Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints | 2019-02-22 | Paper |
| A Compact Formulation for the $\ell _{2,1}$ Mixed-Norm Minimization Problem | 2019-02-12 | Paper |
| Solving MIPs via scaling-based augmentation | 2018-08-17 | Paper |
| Branch-and-cut for linear programs with overlapping SOS1 constraints | 2018-06-25 | Paper |
| Complexity of minimum irreducible infeasible subsystem covers for flow networks | 2018-05-24 | Paper |
| A characterization of irreducible infeasible subsystems in flow networks | 2018-05-23 | Paper |
| A framework for solving mixed-integer semidefinite programs | 2018-05-03 | Paper |
| A Mixed-Integer Nonlinear Program for the Design of Gearboxes | 2017-12-01 | Paper |
| On the Complexity of Instationary Gas Flows | 2017-08-29 | Paper |
| Solving Basis Pursuit | 2017-06-30 | Paper |
| The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing | 2017-06-08 | Paper |
| Chapter 5: Mathematical optimization for evaluating gas network capacities | 2016-07-20 | Paper |
| Chapter 4: State of the art in evaluating gas network capacities | 2016-07-20 | Paper |
| Chapter 12: Computational results for validation of nominations | 2016-07-20 | Paper |
| A polyhedral investigation of star colorings | 2016-05-18 | Paper |
| Validation of nominations in gas network optimization: models, methods, and solutions | 2015-09-04 | Paper |
| Progress in Academic Computational Integer Programming | 2015-07-22 | Paper |
| An infeasible-point subgradient method using adaptive approximate projections | 2014-10-10 | Paper |
| The Steiner connectivity problem | 2014-02-03 | Paper |
| A heuristic and an exact method for the gate matrix connection cost minimization problem | 2013-11-14 | Paper |
| Line planning on tree networks with applications to the Quito Trolebús system | 2013-03-19 | Paper |
| Computing the bounded subcomplex of an unbounded polyhedron | 2013-03-12 | Paper |
| Models for fare planning in public transport | 2012-11-22 | Paper |
| Line planning on paths and tree networks with applications to the Quito trolebús system | 2012-09-28 | Paper |
| Orbitopal fixing | 2012-04-05 | Paper |
| The maximum \(k\)-colorable subgraph problem and orbitopes | 2012-03-07 | Paper |
| Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry | 2011-05-26 | Paper |
| Heuristics for Budget Facility Location-Network Design Problems with Minisum Objective | 2011-04-07 | Paper |
| The Line Connectivity Problem | 2011-04-07 | Paper |
| Detecting Orbitopal Symmetries | 2011-04-07 | Paper |
| Sparse approximate solution of partial differential equations | 2010-05-25 | Paper |
| Exact and Approximate Sparse Solutions of Underdetermined Linear Equations | 2010-03-10 | Paper |
| Competitive online multicommodity routing | 2009-09-02 | Paper |
| Branch-and-Cut for the Maximum Feasible Subsystem Problem | 2009-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3525436 | 2008-09-12 | Paper |
| Packing and partitioning orbitopes | 2008-06-03 | Paper |
| Competitive Online Multicommodity Routing | 2008-02-21 | Paper |
| Orbitopal Fixing | 2007-11-29 | Paper |
| Computing Optimal Discrete Morse Functions | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416575 | 2007-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416594 | 2007-01-22 | Paper |
| Computing Optimal Morse Matchings | 2006-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3023951 | 2005-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418120 | 2003-08-07 | Paper |
| On the maximum feasible subsystem problem, IISs and IIS-hypergraphs | 2003-07-13 | Paper |
| Computing the face lattice of a polytope from its vertex-facet incidences | 2003-03-10 | Paper |
| Ambiguous incidences of unbounded polyhedra | 2002-01-23 | Paper |
| Examples for generalized antiweb-facets | 2002-01-23 | Paper |
| Vertex-facet incidences of unbounded polyhedra | 2001-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263701 | 1999-11-21 | Paper |
| Learning Cuts via Enumeration Oracles | N/A | Paper |
| The SCIP Optimization Suite 9.0 | N/A | Paper |
