| Publication | Date of Publication | Type |
|---|
Chvátal-Gomory Rounding of Eigenvector Inequalities for QCQPs
(available as arXiv preprint) | 2026-01-01 | Paper |
A characterization of maximal inhomogeneous-quadratic-free sets
(available as arXiv preprint) | 2026-01-01 | Paper |
Exploiting the polyhedral geometry of stochastic linear bilevel programming
Mathematical Programming. Series A. Series B | 2025-03-05 | Paper |
Compressing branch-and-bound trees
Mathematical Programming. Series A. Series B | 2025-03-05 | Paper |
A characterization of maximal homogeneous-quadratic-free sets
Mathematical Programming. Series A. Series B | 2025-03-05 | Paper |
Monoidal strengthening and unique lifting in MIQCPs
Mathematical Programming. Series A. Series B | 2025-03-05 | Paper |
The MIP workshop 2023 computational competition on reoptimization
Mathematical Programming Computation | 2024-08-21 | Paper |
Exact reliability optimization for series‐parallel graphs using convex envelopes
Networks | 2023-12-12 | Paper |
| The MIP Workshop 2023 Computational Competition on Reoptimization | 2023-11-24 | Paper |
Monoidal strengthening and unique lifting in MIQCPs
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Towards a characterization of maximal quadratic-free sets
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Compressing branch-and-bound trees
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Exploiting the polyhedral geometry of stochastic linear bilevel programming
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Principled deep neural network training through linear programming
Discrete Optimization | 2023-09-28 | Paper |
On the implementation and strengthening of intersection cuts for QCQPs
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Maximal quadratic-free sets
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
On generalized surrogate duality in mixed-integer nonlinear programming
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
Convex envelopes for ray-concave functions
Optimization Letters | 2022-10-11 | Paper |
Cutting plane generation through sparse principal component analysis
SIAM Journal on Optimization | 2022-06-17 | Paper |
On obtaining the convex hull of quadratic inequalities via aggregations
SIAM Journal on Optimization | 2022-04-29 | Paper |
New limits of treewidth-based tractability in optimization
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
On generalized surrogate duality in mixed-integer nonlinear programming
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Maximal quadratic-free sets
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
On the implementation and strengthening of intersection cuts for QCQPs
Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
Production scheduling for strategic open pit mine planning: a mixed-integer programming approach
Operations Research | 2021-01-19 | Paper |
Outer-product-free sets for polynomial optimization and oracle-based cuts
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
| Intersection cuts for polynomial optimization | 2020-02-06 | Paper |
LP formulations for polynomial optimization problems
SIAM Journal on Optimization | 2018-04-24 | Paper |
A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling
Computational Optimization and Applications | 2018-04-20 | Paper |
| Robust linear control of nonconvex battery operation in transmission systems | 2016-10-28 | Paper |
Robust linear control of nonconvex battery operation in transmission systems
(available as arXiv preprint) | 2016-01-01 | Paper |
| On linear relaxations of OPF problems | 2014-11-04 | Paper |
On linear relaxations of OPF problems
(available as arXiv preprint) | 2014-01-01 | Paper |
