| Publication | Date of Publication | Type |
|---|
| A reformulation-enumeration MINLP algorithm for gas network design | 2024-11-12 | Paper |
| Solving sparse separable bilinear programs using lifted bilinear cover inequalities | 2024-07-29 | Paper |
| A theoretical and computational analysis of full strong-branching | 2024-04-09 | Paper |
| Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity | 2024-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147284 | 2024-01-15 | Paper |
| Sensitivity analysis for mixed binary quadratic programming | 2023-12-10 | Paper |
| Branch-and-bound solves random binary IPs in poly\((n)\)-time | 2023-05-25 | Paper |
| Solving sparse principal component analysis with global support | 2023-05-02 | Paper |
| Node-based valid inequalities for the optimal transmission switching problem | 2023-03-29 | Paper |
| Strong mixed-integer formulations for the floor layout problem | 2023-03-15 | Paper |
| Beating the SDP bound for the floor layout problem: a simple combinatorial idea | 2023-03-15 | Paper |
| Lifting convex inequalities for bipartite bilinear programs | 2023-03-14 | Paper |
| Lower bounds on the size of general branch-and-bound trees | 2023-03-01 | Paper |
| Lower bound on size of branch-and-bound trees for solving lot-sizing problem | 2022-10-17 | Paper |
| Approximation Algorithms for Training One-Node ReLU Neural Networks | 2022-09-23 | Paper |
| A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid | 2022-09-19 | Paper |
| Exploiting Instance and Variable Similarity to Improve Learning-Enhanced Branching | 2022-08-21 | Paper |
| Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA | 2022-08-05 | Paper |
| Estimating parameters of mixtures of multivariate \(t\)-populations and application to classification of observations | 2022-08-04 | Paper |
| Solving sparse separable bilinear programs using lifted bilinear cover inequalities | 2022-07-30 | Paper |
| Rokhlin property for group actions on Hilbert \(C^*\)-modules | 2022-07-01 | Paper |
| Cutting Plane Generation through Sparse Principal Component Analysis | 2022-06-17 | Paper |
| Complexity of training ReLU neural network | 2022-06-09 | Paper |
| Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices | 2022-04-29 | Paper |
| On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations | 2022-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5066735 | 2022-03-30 | Paper |
| Sparse PSD approximation of the PSD cone | 2022-03-22 | Paper |
| Node-based valid inequalities for the optimal transmission switching problem | 2021-12-25 | Paper |
| Lifting convex inequalities for bipartite bilinear programs | 2021-12-21 | Paper |
| Lower bound on size of branch-and-bound trees for solving lot-sizing problem | 2021-12-07 | Paper |
| Inference on parameters of Watson distributions and application to classification of observations | 2021-11-24 | Paper |
| Comparing geometric discord and negativity for bipartite states | 2021-10-12 | Paper |
| Lower Bounds on the Size of General Branch-and-Bound Trees | 2021-03-17 | Paper |
| Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming | 2021-03-11 | Paper |
| Optimization-Driven Scenario Grouping | 2021-01-07 | Paper |
| Using Submodularity within Column Generation to Solve the Flight-to-Gate Assignment Problem | 2020-11-11 | Paper |
| The Convex Hull of a Quadratic Constraint over a Polytope | 2020-11-09 | Paper |
| The order-\(n\) minors of certain \((n+k)\times n\) matrices | 2020-08-28 | Paper |
| Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem | 2020-05-04 | Paper |
| Subset Selection in Sparse Matrices | 2020-04-24 | Paper |
| A K-Nearest Neighbor Heuristic for Real-Time DC Optimal Transmission Switching | 2020-03-23 | Paper |
| Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs | 2020-03-11 | Paper |
| The strength of multi-row aggregation cuts for sign-pattern integer programs | 2020-02-10 | Paper |
| Decomposable Formulation of Transmission Constraints for Decentralized Power Systems Optimization | 2020-01-21 | Paper |
| New SOCP relaxation and branching rule for bipartite bilinear programs | 2019-10-29 | Paper |
| Bures distance and transition probability for \(\alpha\)-CPD-kernels | 2019-07-18 | Paper |
| Nonunique Lifting of Integer Variables in Minimal Inequalities | 2019-05-13 | Paper |
| Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem | 2019-05-03 | Paper |
| Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs | 2019-01-14 | Paper |
| An Approximation Algorithm for training One-Node ReLU Neural Network | 2018-10-08 | Paper |
| On a cardinality-constrained transportation problem with market choice | 2018-10-01 | Paper |
| Some lower bounds on sparse outer approximations of polytopes | 2018-09-28 | Paper |
| Aggregation-based cutting-planes for packing and covering integer programs | 2018-09-28 | Paper |
| Incorporating views on marginal distributions in the calibration of risk models | 2018-09-28 | Paper |
| Characteristic functions of liftings-II | 2018-07-18 | Paper |
| Theoretical challenges towards cutting-plane selection | 2018-07-13 | Paper |
| Some cut-generating functions for second-order conic sets | 2018-05-24 | Paper |
| Improving the Randomization Step in Feasibility Pump | 2018-02-14 | Paper |
| Sparse principal component analysis and its $l_1$-relaxation | 2017-12-03 | Paper |
| KSGNS construction for τ-maps on S-modules and ᵌ0-families | 2017-10-06 | Paper |
| \(\mathfrak{K}\)-families and CPD-H-extendable families | 2017-07-11 | Paper |
| Mixed-integer quadratic programming is in NP | 2017-03-23 | Paper |
| Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions | 2017-03-23 | Paper |
| Relaxations and discretizations for the pooling problem | 2017-03-03 | Paper |
| On the Practical Strength of Two-Row Tableau Cuts | 2017-02-17 | Paper |
| Strong SOCP Relaxations for the Optimal Power Flow Problem | 2017-01-26 | Paper |
| Improving the integer L-shaped method | 2016-11-01 | Paper |
| A cycle-based formulation and valid inequalities for DC power transmission problems with switching | 2016-10-31 | Paper |
| Groves mechanisms and communication externalities | 2016-05-13 | Paper |
| Beating the SDP bound for the floor layout problem: A simple combinatorial idea | 2016-02-25 | Paper |
| Closedness of Integer Hulls of Simple Conic Sets | 2016-01-15 | Paper |
| Approximating polyhedra with sparse inequalities | 2015-12-09 | Paper |
| Strengthened bounds for the probability of \(k\)-out-of-\(n\) events | 2015-12-07 | Paper |
| Analysis of MILP Techniques for the Pooling Problem | 2015-11-20 | Paper |
| New Formulation and Strong MISOCP Relaxations for AC Optimal Transmission Switching Problem | 2015-10-07 | Paper |
| Generalized Repeated Interaction Model and Transfer Functions | 2015-09-07 | Paper |
| Functional models and minimal contractive liftings | 2015-06-18 | Paper |
| Forbidden Vertices | 2015-05-29 | Paper |
| Covering Linear Programming with Violations | 2015-01-27 | Paper |
| On the transportation problem with market choice | 2014-12-05 | Paper |
| Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow | 2014-10-03 | Paper |
| On the Chvátal-Gomory closure of a compact convex set | 2014-06-27 | Paper |
| Semi-continuous network flow problems | 2014-06-27 | Paper |
| Design and verify: a new scheme for generating cutting-planes | 2014-06-27 | Paper |
| How Good Are Sparse Cutting-Planes? | 2014-06-02 | Paper |
| Some properties of convex hulls of integer points contained in general convex sets | 2013-11-11 | Paper |
| Solving mixed integer bilinear problems using MILP formulations | 2013-09-25 | Paper |
| A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets | 2013-03-19 | Paper |
| A Strong Dual for Conic Mixed-Integer Programs | 2013-01-04 | Paper |
| Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra | 2012-10-15 | Paper |
| Linear-programming-based lifting and its application to primal cutting-plane algorithms | 2012-07-28 | Paper |
| Composite lifting of group inequalities and an application to two-row mixing inequalities | 2012-06-20 | Paper |
| Split rank of triangle and quadrilateral inequalities | 2012-05-24 | Paper |
| The Chvátal-Gomory closure of a strictly convex body | 2012-05-24 | Paper |
| On mixed-integer sets with two integer variables | 2012-04-05 | Paper |
| Standard commuting dilations and liftings | 2012-04-02 | Paper |
| A note on the split rank of intersection cuts | 2011-11-23 | Paper |
| On Maximal S-Free Convex Sets | 2011-10-27 | Paper |
| The split closure of a strictly convex body | 2011-08-09 | Paper |
| Design and verify: A new scheme for generating cutting-planes | 2011-06-24 | Paper |
| On the Chvátal-Gomory closure of a compact convex set | 2011-06-24 | Paper |
| Characteristic functions of liftings | 2011-04-06 | Paper |
| Constrained infinite group relaxations of MIPs | 2011-03-21 | Paper |
| Liftings of covariant representations of \(W^*\)-correspondences | 2010-11-18 | Paper |
| Two row mixed-integer cuts via lifting | 2010-09-16 | Paper |
| Experiments with two row tableau cuts | 2010-06-22 | Paper |
| The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron | 2010-06-22 | Paper |
| The group-theoretic approach in mixed integer programming | 2010-06-03 | Paper |
| Relations between facets of low- and high-dimensional group problems | 2010-04-15 | Paper |
| On the extreme inequalities of infinite group problems | 2010-02-19 | Paper |
| Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles | 2008-06-10 | Paper |
| Facets of Two-Dimensional Infinite Group Problems | 2008-05-27 | Paper |
| Sequential-Merge Facets for Two-Dimensional Group Problems | 2007-11-29 | Paper |
| Characteristic functions for ergodic tuples | 2007-10-22 | Paper |
| Minimal Cuntz--Krieger dilations and representations of Cuntz--Krieger algebras | 2007-08-29 | Paper |
| Standard dilations of q-commuting tuples | 2007-01-10 | Paper |
| Standard noncommuting and commuting dilations of commuting tuples | 2004-01-07 | Paper |
| A reformulation-enumeration MINLP algorithm for gas network design | N/A | Paper |
| On Sparse Canonical Correlation Analysis | N/A | Paper |
| Regularized MIP Model for Optimal Power Flow with Energy Storage Systems and its Applications | N/A | Paper |
| Non-Monotonicity of Branching Rules with respect to Linear Relaxations | N/A | Paper |
