| Publication | Date of Publication | Type |
|---|
Continuous equality knapsack with probit-style objectives
Journal of Optimization Theory and Applications | 2024-10-07 | Paper |
Numerical range and a generalization of Duffin's overdamping criterion
Computational Mathematics and Mathematical Physics | 2024-06-10 | Paper |
Complexity, exactness, and rationality in polynomial optimization
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
| Enhancements of Discretization Approaches for Non-Convex Mixed-Integer Quadratically Constraint Quadratic Programming: Part II | 2023-02-02 | Paper |
Equivariant perturbation in Gomory and Johnson's infinite group problem. VII: Inverse semigroup theory, closures, decomposition of perturbations
OJMO. Open Journal of Mathematical Optimization | 2022-11-09 | Paper |
| Continuous Equality Knapsack with Probit-Style Objectives | 2022-11-03 | Paper |
| Enhancements of Discretization Approaches for Non-Convex Mixed-Integer Quadratically Constraint Quadratic Programming: Part I | 2022-11-02 | Paper |
Compact mixed-integer programming formulations in quadratic optimization
Journal of Global Optimization | 2022-10-24 | Paper |
Complexity, exactness, and rationality in polynomial optimization
Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
| An Approximate Method for the Optimization of Long-Horizon Tank Blending and Scheduling Operations | 2020-06-12 | Paper |
| On perturbation spaces of minimal valid functions: inverse semigroup theory and equivariant decomposition theorem | 2020-02-06 | Paper |
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. VII. Inverse semigroup theory, closures, decomposition of perturbations
(available as arXiv preprint) | 2018-11-15 | Paper |
Minimal cut-generating functions are nearly extreme
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Note on the complexity of the mixed-integer hull of a polyhedron
Operations Research Letters | 2018-09-28 | Paper |
Note on the complexity of the mixed-integer hull of a polyhedron
Operations Research Letters | 2018-09-28 | Paper |
Extension complexity lower bounds for mixed-integer extended formulations
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
An FPTAS for minimizing indefinite quadratic forms over integers in polyhedra
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Binary extended formulations of polyhedral mixed-integer sets
Mathematical Programming. Series A. Series B | 2018-07-13 | Paper |
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
Mathematical Programming. Series A. Series B | 2018-06-25 | Paper |
Sublinear bounds for a quantitative Doignon-Bell-Scarf theorem
SIAM Journal on Discrete Mathematics | 2018-02-07 | Paper |
| Binary Extended Formulations | 2018-01-03 | Paper |
Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\)
Mathematical Programming. Series A. Series B | 2017-05-15 | Paper |
Minimal cut-generating functions are nearly extreme
Lecture Notes in Computer Science | 2016-08-10 | Paper |
Light on the infinite group relaxation. II: Sufficient conditions for extremality, sequences, and algorithms
4OR | 2016-06-14 | Paper |
Minimizing cubic and homogeneous polynomials over integers in the plane
Mathematics of Operations Research | 2016-05-19 | Paper |
Light on the infinite group relaxation. I: Foundations and taxonomy
4OR | 2016-03-29 | Paper |
Equivariant perturbation in Gomory and Johnson's infinite group problem. I: The one-dimensional case
Mathematics of Operations Research | 2015-04-01 | Paper |
The triangle closure is a polyhedron
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
A \((k+1)\)-slope theorem for the \(k\)-dimensional infinite group relaxation
SIAM Journal on Optimization | 2013-09-25 | Paper |
Equivariant perturbation in Gomory and Johnson's infinite group problem. II: The unimodular two-dimensional case
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)
Discrete Optimization | 2013-03-13 | Paper |
Optimizing Representation in Redistricting: Dual Bounds for Partitioning Problems with Non-Convex Objectives
(available as arXiv preprint) | N/A | Paper |
