| Publication | Date of Publication | Type |
|---|
| Random projections for semidefinite programming | 2024-10-16 | Paper |
| Random projections for linear programming: an improved retrieval phase | 2024-07-26 | Paper |
| An impossible combinatorial counting method in distance geometry | 2024-06-20 | Paper |
| Pseudo-dihedral angles in proteins providing a new description of the Ramachandran map | 2024-01-16 | Paper |
| Optimal deployment of indoor wireless local area networks | 2023-12-18 | Paper |
| Profit sharing mechanisms in multi-owned cascaded hydrosystems | 2023-09-18 | Paper |
| Cycle-based formulations in distance geometry | 2023-07-12 | Paper |
| Submodular maximization and its generalization through an intersection cut lens | 2023-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5053304 | 2022-12-06 | Paper |
| Cutting planes for signomial programming | 2022-12-06 | Paper |
| Convergent Algorithms for a Class of Convex Semi-infinite Programs | 2022-10-21 | Paper |
| Mathematical programming formulations for the alternating current optimal power flow problem | 2022-08-01 | Paper |
| Maximum feasible subsystems of distance geometry constraints | 2022-04-25 | Paper |
| Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections | 2022-04-25 | Paper |
| Unassigned distance geometry and molecular conformation problems | 2022-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5037695 | 2022-03-04 | Paper |
| Polynomial programming prevents aircraft (and other) conflicts | 2021-12-13 | Paper |
| A cycle-based formulation for the distance geometry problem | 2021-12-08 | Paper |
| An impossible utopia in distance geometry | 2021-10-04 | Paper |
| Detecting and solving aircraft conflicts using bilevel programming | 2021-09-29 | Paper |
| Learning discontinuous piecewise affine fitting functions using mixed integer programming over lattice | 2021-08-17 | Paper |
| A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances | 2021-07-26 | Paper |
| Random projections for conic programs | 2021-07-14 | Paper |
| Mathematical programming formulations for the alternating current optimal power flow problem | 2021-05-11 | Paper |
| Exploiting symmetries in mathematical programming via orbital independence | 2021-05-05 | Paper |
| Flying safely by bilevel programming | 2020-12-15 | Paper |
| A new algorithm for the $^K$DMDGP subclass of Distance Geometry Problems | 2020-09-11 | Paper |
| Random projections for quadratic programs | 2020-08-28 | Paper |
| Rejoinder on: ``Distance geometry and data science | 2020-06-26 | Paper |
| Distance geometry and data science | 2020-06-26 | Paper |
| The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry | 2020-04-27 | Paper |
| On an SDP relaxation for kissing number | 2020-04-27 | Paper |
| Random Projections for Linear Programming | 2020-03-12 | Paper |
| Barvinok's naive algorithm in distance geometry | 2020-02-10 | Paper |
| Random projections for quadratic programs over a Euclidean ball | 2020-02-06 | Paper |
| Algorithms and applications for a class of bilevel MILPs | 2019-12-30 | Paper |
| QPLIB: a library of quadratic programming instances | 2019-12-19 | Paper |
| Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization | 2019-10-29 | Paper |
| Distance Geometry and Data Science | 2019-09-18 | Paper |
| Open research areas in distance geometry | 2019-09-09 | Paper |
| On the polynomiality of finding \(^K\text{DMDGP}\) re-orders | 2019-09-05 | Paper |
| Undecidability and hardness in mixed-integer nonlinear programming | 2019-06-07 | Paper |
| A mathematical programming formulation for the Hartree-Fock problem on open-shell systems | 2019-05-10 | Paper |
| Realizing Euclidean distance matrices by sphere intersection | 2019-02-21 | Paper |
| Minimal NMR distance information for rigidity of protein graphs | 2019-02-21 | Paper |
| Tuning interval branch-and-prune for protein structure determination | 2018-12-21 | Paper |
| Gaussian random projections for Euclidean membership problems | 2018-12-18 | Paper |
| Orbital shrinking: theory and applications | 2018-09-25 | Paper |
| A symmetry-based splitting strategy for discretizable distance geometry problems | 2018-08-29 | Paper |
| Maximum concurrent flow with incomplete data | 2018-08-17 | Paper |
| Alternating current optimal power flow with generator selection | 2018-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580147 | 2018-08-13 | Paper |
| The power edge set problem | 2018-05-23 | Paper |
| Complexity and inapproximability results for the power edge set problem | 2018-04-13 | Paper |
| Constraint qualification failure in action | 2018-02-06 | Paper |
| Distance geometry in linearizable norms | 2018-01-12 | Paper |
| Recent advances on the interval distance geometry problem | 2017-12-07 | Paper |
| On a Relationship Between Graph Realizability and Distance Matrix Completion | 2017-11-30 | Paper |
| An Introduction to Distance Geometry applied to Molecular Geometry | 2017-11-01 | Paper |
| Surrogate‐based methods for black‐box optimization | 2017-07-13 | Paper |
| Euclidean Distance Geometry | 2017-06-30 | Paper |
| Random projections for trust region subproblems | 2017-06-08 | Paper |
| A multiplicative weights update algorithm for MINLP | 2017-05-23 | Paper |
| New error measures and methods for realizing protein graphs from distance data | 2017-03-23 | Paper |
| New methods for the distance geometry problem | 2017-02-14 | Paper |
| Solving LP using random projections | 2017-02-14 | Paper |
| Distance Geometry on the Sphere | 2017-02-01 | Paper |
| Diagonally Dominant Programming in Distance Geometry | 2016-11-30 | Paper |
| Divisive heuristic for modularity density maximization | 2016-11-17 | Paper |
| The anonymous subgraph problem | 2016-11-14 | Paper |
| Efficient computation of shortest paths in time-dependent multi-modal networks | 2016-10-24 | Paper |
| Six mathematical gems from the history of distance geometry | 2016-10-21 | Paper |
| An algorithm for realizing Euclidean distance matrices | 2016-10-17 | Paper |
| Twelve surveys in operations research | 2016-07-22 | Paper |
| Static analysis by abstract interpretation: a mathematical programming approach | 2016-06-17 | Paper |
| On an optimal constraint aggregation method for integer programming and on an analytic expression of the number of integer points in a polytope | 2016-05-27 | Paper |
| Observing the State of a Smart Grid Using Bilevel Programming | 2016-02-05 | Paper |
| Orbital Independence in Symmetric Mathematical Programs | 2016-02-05 | Paper |
| Community detection with the weighted parsimony criterion | 2016-01-14 | Paper |
| Discretization vertex orders in distance geometry | 2015-09-30 | Paper |
| Optimization and sustainable development | 2015-07-24 | Paper |
| On the Composition of Convex Envelopes for Quadrilinear Terms | 2015-03-30 | Paper |
| Stabilizer-based symmetry breaking constraints for mathematical programs | 2015-01-15 | Paper |
| Branching on split disjunctions | 2014-11-10 | Paper |
| Improving heuristics for network modularity maximization using an exact algorithm | 2014-09-08 | Paper |
| Mathematical programming: Turing completeness and applications to software analysis | 2014-09-05 | Paper |
| On the number of realizations of certain Henneberg graphs arising in protein conformation | 2014-05-05 | Paper |
| On the Weber facility location problem with limited distances and side constraints | 2014-04-30 | Paper |
| Counting the Number of Solutions of KDMDGP Instances | 2014-04-16 | Paper |
| Euclidean Distance Geometry and Applications | 2014-04-09 | Paper |
| A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem | 2014-01-30 | Paper |
| A recipe for finding good solutions to MINLPs | 2013-11-28 | Paper |
| Mathematical programming based debugging | 2013-11-08 | Paper |
| Formulation symmetries in circle packing | 2013-11-08 | Paper |
| Optimal design of electrical machines: mathematical programming formulations | 2013-08-16 | Paper |
| The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances | 2013-08-01 | Paper |
| Is the Distance Geometry Problem in NP? | 2013-07-29 | Paper |
| The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins | 2013-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5298937 | 2013-06-25 | Paper |
| Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases | 2013-06-10 | Paper |
| A matroid view of key theorems for edge-swapping algorithms | 2013-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4899827 | 2013-01-10 | Paper |
| Recent advances on the discretizable molecular distance geometry problem | 2012-12-29 | Paper |
| The discretizable distance geometry problem | 2012-12-28 | Paper |
| A storm of feasibility pumps for nonconvex MINLP | 2012-12-19 | Paper |
| Preface | 2012-12-19 | Paper |
| The discretizable molecular distance geometry problem | 2012-12-13 | Paper |
| Discretization orders for distance geometry problems | 2012-11-30 | Paper |
| On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square | 2012-11-22 | Paper |
| Orbital Shrinking | 2012-11-02 | Paper |
| UniALT for regular language contrained shortest paths on a multi-modal transportation network | 2012-09-28 | Paper |
| Symmetry in Mathematical Programming | 2012-07-10 | Paper |
| Bidirectional \(A^*\) search on time-dependent road networks | 2012-06-18 | Paper |
| Reduced RLT representations for nonconvex polynomial programming problems | 2012-06-13 | Paper |
| An improved column generation algorithm for minimum sum-of-squares clustering | 2012-02-22 | Paper |
| Reformulations in mathematical programming: automatic symmetry detection and exploitation | 2012-02-22 | Paper |
| Improved strategies for branching on general disjunctions | 2011-12-14 | Paper |
| Edge cover by connected bipartite subgraphs | 2011-11-17 | Paper |
| A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem | 2011-09-09 | Paper |
| Molecular distance geometry methods: from continuous to discrete | 2011-08-17 | Paper |
| On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem | 2011-08-12 | Paper |
| On the computation of protein backbones by using artificial backbones of hydrogens | 2011-06-03 | Paper |
| On a class of nonconvex problems where all local minima are global | 2011-01-25 | Paper |
| Feasibility-Based Bounds Tightening via Fixed Points | 2011-01-08 | Paper |
| On interval-subgradient and no-good cuts | 2010-12-20 | Paper |
| On convex relaxations of quadrilinear terms | 2010-10-06 | Paper |
| The Reformulation-Optimization Software Engine | 2010-09-14 | Paper |
| MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems | 2010-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3565732 | 2010-06-07 | Paper |
| Fast paths in large-scale dynamic road networks | 2010-03-15 | Paper |
| Shortest paths on dynamic graphs | 2009-10-28 | Paper |
| Branching and bounds tighteningtechniques for non-convex MINLP | 2009-09-18 | Paper |
| Double variable neighbourhood search with smoothing for the molecular distance geometry problem | 2009-07-13 | Paper |
| Reformulation in mathematical programming: An application to quantum chemistry | 2009-06-23 | Paper |
| Editorial: Reformulation techniques in mathematical programming | 2009-06-23 | Paper |
| Optimally Running a Biomass-Based Energy Production Process | 2009-05-20 | Paper |
| Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem | 2009-05-13 | Paper |
| Edge-swapping algorithms for the minimum fundamental cycle basis problem | 2009-04-27 | Paper |
| Reformulations in Mathematical Programming: Definitions and Systematics | 2009-04-23 | Paper |
| Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem | 2009-02-17 | Paper |
| Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks | 2009-01-27 | Paper |
| Automatic Generation of Symmetry-Breaking Constraints | 2009-01-27 | Paper |
| A local branching heuristic for MINLPs | 2008-12-11 | Paper |
| The Secret Santa Problem | 2008-07-10 | Paper |
| Bidirectional A ∗ Search for Time-Dependent Fast Paths | 2008-06-13 | Paper |
| Spherical cuts for integer programming problems | 2008-05-29 | Paper |
| A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem | 2008-05-22 | Paper |
| Compact linearization for binary quadratic problems | 2008-03-14 | Paper |
| Computational Experience with the Molecular Distance Geometry Problem | 2007-11-27 | Paper |
| New formulations for the Kissing Number Problem | 2007-09-19 | Paper |
| The Kissing Number Problem: A New Result from Global Optimization | 2007-05-29 | Paper |
| Algorithms for finding minimum fundamental cycle bases in graphs | 2007-05-29 | Paper |
| An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms | 2007-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5492526 | 2006-10-13 | Paper |
| Linearity embedded in nonconvex programs | 2006-01-13 | Paper |
| Comparison of deterministic and stochastic approaches to global optimization | 2005-07-04 | Paper |
| Reduction constraints for the global optimization of NLPs | 2005-03-04 | Paper |
| Reformulation and convex relaxation techniques for global optimization | 2005-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817248 | 2004-09-22 | Paper |
| Convex envelopes of monomials of odd degree | 2003-10-27 | Paper |
| Structure of the invertible CA transformations group | 2000-03-19 | Paper |
