| Publication | Date of Publication | Type |
|---|
On the convex hull of convex quadratic optimization problems with indicators
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
\(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables
Mathematical Programming. Series A. Series B | 2023-10-23 | Paper |
Supermodularity and valid inequalities for quadratic optimization with indicators
Mathematical Programming. Series A. Series B | 2023-08-01 | Paper |
On the Softplus Penalty for Constrained Convex Optimization
| 2023-05-21 | Paper |
Submodular function minimization and polarity
Mathematical Programming. Series A. Series B | 2022-11-14 | Paper |
The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables
Operations Research Letters | 2022-03-11 | Paper |
New Penalized Stochastic Gradient Methods for Linearly Constrained Strongly Convex Optimization
| 2022-02-14 | Paper |
The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables
| 2021-12-08 | Paper |
scientific article; zbMATH DE number 7370569 (Why is no real title available?)
| 2021-07-09 | Paper |
Penalized semidefinite programming for quadratically-constrained quadratic optimization
Journal of Global Optimization | 2021-04-28 | Paper |
Successive quadratic upper-bounding for discrete mean-risk minimization and network interdiction
INFORMS Journal on Computing | 2021-01-07 | Paper |
Submodularity in Conic Quadratic Mixed 0–1 Optimization
Operations Research | 2020-11-08 | Paper |
Technical note: A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model
Operations Research | 2020-10-12 | Paper |
Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
Mathematical Programming Computation | 2019-12-19 | Paper |
Network design with probabilistic capacities
Networks | 2019-08-12 | Paper |
Lifted polymatroid inequalities for mean-risk optimization with indicator variables
Journal of Global Optimization | 2019-06-20 | Paper |
A note on capacity models for network design
Operations Research Letters | 2019-06-11 | Paper |
Strong formulations for quadratic optimization with M-matrices and indicator variables
Mathematical Programming. Series A. Series B | 2018-07-13 | Paper |
Accommodating new flights into an existing airline flight schedule
| 2018-06-07 | Paper |
Supermodular covering knapsack polytope
Discrete Optimization | 2018-05-24 | Paper |
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems
Networks | 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
Mathematical Programming. Series A. Series B | 2017-10-27 | Paper |
Path cover and path pack inequalities for the capacitated fixed-charge network flow problem
SIAM Journal on Optimization | 2017-09-07 | Paper |
Maximizing a class of utility functions over the vertices of a polytope
Operations Research | 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
Mathematical Programming. Series A. Series B | 2016-08-25 | Paper |
Aircraft rescheduling with cruise speed control
Operations Research | 2014-11-26 | Paper |
A conic integer programming approach to stochastic joint location-inventory problems
Operations Research | 2012-10-01 | Paper |
\(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
Mathematical Programming. Series A. Series B | 2012-04-27 | Paper |
Capacity acquisition, subcontracting, and lot sizing
Management Science | 2012-02-19 | Paper |
Maximizing a class of submodular utility functions
Mathematical Programming. Series A. Series B | 2011-06-17 | Paper |
The Flow Set with Partial Order
Mathematics of Operations Research | 2011-04-27 | Paper |
Lifting for conic mixed-integer programming
Mathematical Programming. Series A. Series B | 2011-02-14 | Paper |
Parallel machine match-up scheduling with manufacturing cost considerations
Journal of Scheduling | 2010-05-07 | Paper |
Mingling: mixed-integer rounding with bounds
Mathematical Programming. Series A. Series B | 2010-04-15 | Paper |
Conic mixed-integer rounding cuts
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
The submodular knapsack polytope
Discrete Optimization | 2009-11-23 | Paper |
A strong conic quadratic reformulation for machine-job assignment with controllable processing times
Operations Research Letters | 2009-08-14 | Paper |
Two-Stage Robust Network Flow and Design Under Demand Uncertainty
Operations Research | 2009-08-13 | Paper |
Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
Operations Research | 2009-07-18 | Paper |
Sequence Independent Lifting for Mixed-Integer Programming
Operations Research | 2009-07-10 | Paper |
Polymatroids and mean-risk minimization in discrete optimization
Operations Research Letters | 2008-11-27 | Paper |
Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
Discrete Optimization | 2008-10-29 | Paper |
An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs
Operations Research Letters | 2008-09-10 | Paper |
Cuts for Conic Mixed-Integer Programming
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Network design arc set with variable upper bounds
Networks | 2007-07-20 | Paper |
Strong formulations of robust mixed 0-1 programming
Mathematical Programming. Series A. Series B | 2006-09-12 | Paper |
Integer-programming software systems
Annals of Operations Research | 2006-03-07 | Paper |
Cover and pack inequalities for (mixed) integer programming
Annals of Operations Research | 2006-03-07 | Paper |
scientific article; zbMATH DE number 2159269 (Why is no real title available?)
| 2005-04-19 | Paper |
A study of the lot-sizing polytope
Mathematical Programming. Series A. Series B | 2004-09-27 | Paper |
A directed cycle-based column-and-cut generation method for capacitated survivable network design
Networks | 2004-08-04 | Paper |
On the facets of the mixed-integer knapsack polyhedron
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
The mixed vertex packing problem.
Mathematical Programming. Series A. Series B | 2004-02-18 | Paper |
On capacitated network design cut-set polyhedra
Mathematical Programming. Series A. Series B | 2002-12-01 | Paper |
Valid inequalities for problems with additive variable upper bounds
Mathematical Programming. Series A. Series B | 2002-05-27 | Paper |
Flow pack facets of the single node fixed-charge flow polytope
Operations Research Letters | 2002-01-08 | Paper |
On splittable and unsplittable flow capacitated network design arc-set polyhedra.
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
Conflict graphs in solving integer programming problems
European Journal of Operational Research | 2001-05-02 | Paper |
scientific article; zbMATH DE number 1342120 (Why is no real title available?)
| 1999-11-21 | Paper |
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
Journal of Heuristics | 1996-09-01 | Paper |
Polyhedral Analysis of Quadratic Optimization Problems with Stieltjes Matrices and Indicators
| N/A | Paper |
