| Publication | Date of Publication | Type |
|---|
| Capacity evaluation for large-scale gas networks | 2022-10-25 | Paper |
| A tractable multi-leader multi-follower peak-load-pricing model with strategic interaction | 2022-10-24 | Paper |
| Exploiting complete linear descriptions for decentralized power market problems with integralities | 2022-07-15 | Paper |
| Radius of Robust Feasibility for Mixed-Integer Problems | 2022-06-28 | Paper |
| Robust market equilibria under uncertain cost | 2022-06-08 | Paper |
| Global optimization for the multilevel European gas market system with nonlinear flow models on trees | 2022-03-15 | Paper |
| Robust Market Equilibria under Uncertain Cost | 2021-08-20 | Paper |
| Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints | 2021-08-11 | Paper |
| Computing technical capacities in the European entry-exit gas market is NP-hard | 2021-01-07 | Paper |
| Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods | 2020-11-09 | Paper |
| The impact of potential-based physics models on pricing in energy networks | 2020-09-29 | Paper |
| Structural properties of feasible bookings in the European entry-exit gas market system | 2020-06-22 | Paper |
| A decomposition heuristic for mixed-integer supply chain problems | 2020-05-26 | Paper |
| Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes | 2019-11-25 | Paper |
| On electricity market equilibria with storage: modeling, uniqueness, and a distributed ADMM | 2019-11-19 | Paper |
| Maximizing the storage capacity of gas networks: a global MINLP approach | 2019-10-29 | Paper |
| Towards a lifecycle oriented design of infrastructure by mathematical optimization | 2019-10-08 | Paper |
| Algorithmic results for potential‐based flows: Easy and hard cases | 2019-07-30 | Paper |
| Robust optimal discrete arc sizing for tree-shaped potential networks | 2019-06-13 | Paper |
| A multilevel model of the European entry-exit gas market | 2019-05-31 | Paper |
| Computing feasible points for binary MINLPs with MPECs | 2019-05-03 | Paper |
| Optimierung von Versorgungsnetzen | 2019-02-18 | Paper |
| Nonconvex equilibrium models for gas market analysis: failure of standard techniques and alternative modeling approaches | 2018-12-06 | Paper |
| Challenges in Optimal Control Problems for Gas and Fluid Flow in Networks of Pipes and Canals: From Modeling to Industrial Applications | 2018-10-04 | Paper |
| A system to evaluate gas network capacities: concepts and implementation | 2018-07-25 | Paper |
| Uniqueness and multiplicity of market equilibria on DC power flow networks | 2018-07-25 | Paper |
| Uniqueness of market equilibrium on a network: a peak-load pricing approach | 2018-05-29 | Paper |
| Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps | 2017-08-18 | Paper |
| Chapter 6: The MILP-relaxation approach | 2016-07-20 | Paper |
| Chapter 5: Mathematical optimization for evaluating gas network capacities | 2016-07-20 | Paper |
| Chapter 12: Computational results for validation of nominations | 2016-07-20 | Paper |
| Validation of nominations in gas network optimization: models, methods, and solutions | 2015-09-04 | Paper |
| A New Algorithm for MINLP Applied to Gas Transport Energy Cost Minimization | 2015-07-22 | Paper |
| More bounds on the diameters of convex polytopes | 2013-06-24 | Paper |
| Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets | 2013-04-10 | Paper |
| The coolest path problem | 2013-03-21 | Paper |
| On the finite set of missing geometric configurations | 2013-03-12 | Paper |
| Using Piecewise Linear Functions for Solving MINLPs | 2012-07-10 | Paper |
| Generation of Oriented Matroids Using Satisfiability Solvers | 2010-09-14 | Paper |
| Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers | 2010-03-04 | Paper |
| Topological configurations \((n_4)\) exist for all \(n\geq 17\) | 2009-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3433805 | 2007-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5490265 | 2007-01-26 | Paper |
