| Publication | Date of Publication | Type |
|---|
| The MIP workshop 2023 computational competition on reoptimization | 2024-08-21 | Paper |
| Generating hydro unit commitment instances | 2024-04-09 | Paper |
| Optimal deployment of indoor wireless local area networks | 2023-12-18 | Paper |
| Urban air mobility: from complex tactical conflict resolution to network design and fairness insights | 2023-12-11 | Paper |
| Complex portfolio selection via convex mixed‐integer quadratic programming: a survey | 2023-11-27 | Paper |
| The MIP Workshop 2023 Computational Competition on Reoptimization | 2023-11-24 | Paper |
| Profit sharing mechanisms in multi-owned cascaded hydrosystems | 2023-09-18 | Paper |
| Cutting planes for signomial programming | 2022-12-06 | Paper |
| Comparing perspective reformulations for piecewise-convex optimization | 2022-11-28 | Paper |
| Convergent Algorithms for a Class of Convex Semi-infinite Programs | 2022-10-21 | Paper |
| Branch and Price for Submodular Bin Packing | 2022-04-01 | 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 |
| Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley | 2021-06-07 | Paper |
| Lower and upper bounds for the non-linear generalized assignment problem | 2021-04-20 | Paper |
| Handling separable non-convexities using disjunctive cuts | 2021-02-04 | Paper |
| Flying safely by bilevel programming | 2020-12-15 | Paper |
| Random projections for quadratic programs | 2020-08-28 | Paper |
| Strong Convex Nonlinear Relaxations of the Pooling Problem | 2020-06-22 | Paper |
| On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs | 2020-04-27 | 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 |
| Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization | 2019-10-29 | Paper |
| Strengthening the sequential convex MINLP technique by perspective reformulations | 2019-07-10 | Paper |
| MILP models for the selection of a small set of well-distributed points | 2019-02-21 | Paper |
| Maximum concurrent flow with incomplete data | 2018-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580147 | 2018-08-13 | Paper |
| On the product knapsack problem | 2018-08-03 | Paper |
| Feasibility pump for aircraft deconfliction with speed regulation | 2018-07-18 | Paper |
| Relaxations and heuristics for the multiple non-linear separable knapsack problem | 2018-07-11 | Paper |
| A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs | 2018-05-29 | Paper |
| The power edge set problem | 2018-05-23 | Paper |
| Complexity and inapproximability results for the power edge set problem | 2018-04-13 | Paper |
| Distance geometry in linearizable norms | 2018-01-12 | Paper |
| Surrogate‐based methods for black‐box optimization | 2017-07-13 | Paper |
| Random projections for trust region subproblems | 2017-06-08 | Paper |
| Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization | 2017-04-28 | Paper |
| New error measures and methods for realizing protein graphs from distance data | 2017-03-23 | Paper |
| Heuristics for the general multiple non-linear knapsack problem | 2017-02-14 | Paper |
| Mathematical programming techniques in water network optimization | 2016-10-06 | Paper |
| Erratum to ``Mathematical programming techniques in water network optimization | 2016-10-06 | Paper |
| Optimistic MILP modeling of non-linear optimization problems | 2016-06-24 | Paper |
| Observing the State of a Smart Grid Using Bilevel Programming | 2016-02-05 | Paper |
| On the optimal design of water distribution networks: a practical MINLP approach | 2014-08-20 | Paper |
| Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators | 2014-06-02 | Paper |
| Mixed integer nonlinear programming tools: an updated practical overview | 2013-08-08 | Paper |
| A storm of feasibility pumps for nonconvex MINLP | 2012-12-19 | Paper |
| An Algorithmic Framework for MINLP with Separable Non-Convexity | 2012-07-10 | Paper |
| Mixed integer nonlinear programming tools: a practical overview | 2012-03-23 | Paper |
| Valid Inequalities for the Pooling Problem with Binary Variables | 2011-06-24 | Paper |
| On interval-subgradient and no-good cuts | 2010-12-20 | Paper |
| Application-oriented mixed integer non-linear programming | 2010-12-06 | Paper |
| Heuristic algorithms for the general nonlinear separable knapsack problem | 2010-10-15 | Paper |
| Piecewise linear approximation of functions of two variables in MILP models | 2010-03-18 | Paper |
| A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity | 2009-10-29 | Paper |
| An MINLP Solution Method for a Water Network Problem | 2008-03-11 | Paper |
| Formulations of the continuous set-covering problem on networks: a comparative study | N/A | Paper |
