| Publication | Date of Publication | Type |
|---|
| On the convex hull of convex quadratic optimization problems with indicators | 2024-02-21 | Paper |
| \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables | 2023-10-23 | Paper |
| Supermodularity and valid inequalities for quadratic optimization with indicators | 2023-08-01 | Paper |
| Submodular function minimization and polarity | 2022-11-14 | Paper |
| The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables | 2022-03-11 | Paper |
| The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables | 2021-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4998944 | 2021-07-09 | Paper |
| Penalized semidefinite programming for quadratically-constrained quadratic optimization | 2021-04-28 | Paper |
| Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction | 2021-01-07 | Paper |
| Submodularity in Conic Quadratic Mixed 0–1 Optimization | 2020-11-08 | Paper |
| Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model | 2020-10-12 | Paper |
| Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra | 2019-12-19 | Paper |
| Network design with probabilistic capacities | 2019-08-12 | Paper |
| Lifted polymatroid inequalities for mean-risk optimization with indicator variables | 2019-06-20 | Paper |
| A note on capacity models for network design | 2019-06-11 | Paper |
| Strong formulations for quadratic optimization with M-matrices and indicator variables | 2018-07-13 | Paper |
| Accommodating new flights into an existing airline flight schedule | 2018-06-07 | Paper |
| Supermodular covering knapsack polytope | 2018-05-24 | Paper |
| Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems | 2018-05-23 | Paper |
| On Capacity Models for Network Design | 2017-11-28 | Paper |
| A Bound Strengthening Method for Optimal Transmission Switching in Power Systems | 2017-11-28 | Paper |
| A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables | 2017-10-27 | Paper |
| Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem | 2017-09-07 | Paper |
| Maximizing a Class of Utility Functions Over the Vertices of a Polytope | 2017-07-13 | Paper |
| A Scalable Semidefinite Relaxation Approach to Grid Scheduling | 2017-07-12 | Paper |
| Multi-Commodity Multi-Facility Network Design | 2017-07-12 | Paper |
| A polyhedral study of production ramping | 2016-08-25 | Paper |
| Aircraft Rescheduling with Cruise Speed Control | 2014-11-26 | Paper |
| A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems | 2012-10-01 | Paper |
| \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set | 2012-04-27 | Paper |
| Capacity Acquisition, Subcontracting, and Lot Sizing | 2012-02-19 | Paper |
| Maximizing a class of submodular utility functions | 2011-06-17 | Paper |
| The Flow Set with Partial Order | 2011-04-27 | Paper |
| Lifting for conic mixed-integer programming | 2011-02-14 | Paper |
| Parallel machine match-up scheduling with manufacturing cost considerations | 2010-05-07 | Paper |
| Mingling: mixed-integer rounding with bounds | 2010-04-15 | Paper |
| Conic mixed-integer rounding cuts | 2010-02-19 | Paper |
| The submodular knapsack polytope | 2009-11-23 | Paper |
| A strong conic quadratic reformulation for machine-job assignment with controllable processing times | 2009-08-14 | Paper |
| Two-Stage Robust Network Flow and Design Under Demand Uncertainty | 2009-08-13 | Paper |
| Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation | 2009-07-18 | Paper |
| Sequence Independent Lifting for Mixed-Integer Programming | 2009-07-10 | Paper |
| Polymatroids and mean-risk minimization in discrete optimization | 2008-11-27 | Paper |
| Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles | 2008-10-29 | Paper |
| An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs | 2008-09-10 | Paper |
| Cuts for Conic Mixed-Integer Programming | 2007-11-29 | Paper |
| Network design arc set with variable upper bounds | 2007-07-20 | Paper |
| Strong formulations of robust mixed 0-1 programming | 2006-09-12 | Paper |
| Cover and pack inequalities for (mixed) integer programming | 2006-03-07 | Paper |
| Integer-programming software systems | 2006-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667214 | 2005-04-19 | Paper |
| A study of the lot-sizing polytope | 2004-09-27 | Paper |
| A directed cycle-based column-and-cut generation method for capacitated survivable network design | 2004-08-04 | Paper |
| On the facets of the mixed-integer knapsack polyhedron | 2004-03-11 | Paper |
| The mixed vertex packing problem. | 2004-02-18 | Paper |
| On capacitated network design cut-set polyhedra | 2002-12-01 | Paper |
| Valid inequalities for problems with additive variable upper bounds | 2002-05-27 | Paper |
| Flow pack facets of the single node fixed-charge flow polytope | 2002-01-08 | Paper |
| On splittable and unsplittable flow capacitated network design arc-set polyhedra. | 2002-01-01 | Paper |
| Conflict graphs in solving integer programming problems | 2001-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263702 | 1999-11-21 | Paper |
| A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems | 1996-09-01 | Paper |
