| Publication | Date of Publication | Type |
|---|
| Convexification Techniques for Fractional Programs | 2023-10-12 | Paper |
| MIP Relaxations in Factorable Programming | 2023-10-10 | Paper |
| Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis | 2023-01-09 | Paper |
| Probability estimation via policy restrictions, convexification, and approximate sampling | 2022-11-14 | Paper |
| Tractable Relaxations of Composite Functions | 2022-06-27 | Paper |
| Extracting structure from functional expressions for continuous and discrete relaxations of MINLP | 2022-05-03 | Paper |
| A new framework to relax composite functions in nonlinear programs | 2021-10-20 | Paper |
| Convexification techniques for linear complementarity constraints | 2021-08-11 | Paper |
| Optimal Design of Membrane Cascades for Gaseous and Liquid Mixtures via MINLP | 2021-02-09 | Paper |
| Advances in MINLP to Identify Energy-efficient Distillation Configurations | 2020-10-22 | Paper |
| On cutting planes for cardinality-constrained linear programs | 2019-10-22 | Paper |
| Convexification of Permutation-Invariant Sets and an Application to Sparse PCA | 2019-10-06 | Paper |
| Deriving convex hulls through lifting and projection | 2018-06-25 | Paper |
| Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction | 2017-08-18 | Paper |
| Global optimization of nonconvex problems with multilinear intermediates | 2015-07-29 | Paper |
| Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets | 2014-06-27 | Paper |
| Explicit convex and concave envelopes through polyhedral subdivisions | 2013-05-06 | Paper |
| Allocating Objects in a Network of Caches: Centralized and Decentralized Analyses | 2012-02-29 | Paper |
| Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons | 2011-09-27 | Paper |
| Multi-period maintenance scheduling of tree networks with minimum flow disruption | 2011-08-09 | Paper |
| Convexification Techniques for Linear Complementarity Constraints | 2011-06-24 | Paper |
| Strong valid inequalities for orthogonal disjunctions and bilinear covering sets | 2010-09-16 | Paper |
| Lifting inequalities: a framework for generating strong cuts for nonlinear programs | 2010-02-19 | Paper |
| Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs | 2009-09-18 | Paper |
| Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints | 2005-12-13 | Paper |
| A polyhedral branch-and-cut approach to global optimization | 2005-06-14 | Paper |
| A finite branch-and-bound algorithm for two-stage stochastic integer programs | 2004-10-05 | Paper |
| Global optimization of mixed-integer nonlinear programs: a theoretical and computational study | 2004-09-27 | Paper |
| Global optimization of 0-1 hyperbolic programs | 2003-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788630 | 2003-06-02 | Paper |
| Product disaggregation in global optimization and relaxations of rational programs | 2003-03-12 | Paper |
| Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications | 2003-02-04 | Paper |
| Semidefinite relaxations of fractional programs via novel convexification techniques | 2002-12-10 | Paper |
| Convex extensions and envelopes of lower semi-continuous functions | 2002-01-01 | Paper |
