| Publication | Date of Publication | Type |
|---|
| A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs | 2024-09-19 | Paper |
| Relaxations and cutting planes for linear programs with complementarity constraints | 2024-09-17 | Paper |
| On the complexity of separating cutting planes for the knapsack polytope | 2024-08-20 | Paper |
| Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization | 2024-08-20 | Paper |
| New classes of facets for complementarity knapsack problems | 2024-08-09 | Paper |
| On the complexity of binary polynomial optimization over acyclic hypergraphs | 2024-07-19 | Paper |
| Linear Programming and Community Detection | 2024-02-23 | Paper |
| On the complexity of binary polynomial optimization over acyclic hypergraphs | 2023-08-17 | Paper |
| New classes of facets for complementarity knapsack problems | 2023-08-03 | Paper |
| An approximation algorithm for indefinite mixed integer quadratic programming | 2023-08-01 | Paper |
| \(k\)-median: exact recovery in the extended stochastic ball model | 2023-05-25 | Paper |
| Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation | 2023-03-14 | Paper |
| Complexity, exactness, and rationality in polynomial optimization | 2023-03-14 | Paper |
| Sparse PCA on fixed-rank matrices | 2023-03-01 | Paper |
| A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs | 2022-12-15 | Paper |
| On the complexity of separation from the knapsack polytope | 2022-08-16 | Paper |
| Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization | 2022-08-16 | Paper |
| Relaxations and Cutting Planes for Linear Programs with Complementarity Constraints | 2022-08-02 | Paper |
| Proximity in concave integer quadratic programming | 2022-06-29 | Paper |
| Short simplex paths in lattice polytopes | 2022-03-21 | Paper |
| Sparse PCA on fixed-rank matrices | 2022-01-07 | Paper |
| Multi-cover inequalities for totally-ordered multiple knapsack sets | 2021-12-21 | Paper |
| Complexity, exactness, and rationality in polynomial optimization | 2021-12-21 | Paper |
| The Running Intersection Relaxation of the Multilinear Polytope | 2021-09-14 | Paper |
| Integer packing sets form a well-quasi-ordering | 2021-04-07 | Paper |
| On the impact of running intersection inequalities for globally solving polynomial optimization problems | 2020-08-27 | Paper |
| Subset Selection in Sparse Matrices | 2020-04-24 | Paper |
| Subdeterminants and Concave Integer Quadratic Programming | 2019-12-19 | Paper |
| Integer packing sets form a well-quasi-ordering | 2019-11-28 | Paper |
| Characterizations of mixed binary convex quadratic representable sets | 2019-08-06 | Paper |
| Integer quadratic programming in the plane | 2019-06-20 | Paper |
| Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs | 2019-01-14 | Paper |
| On approximation algorithms for concave mixed-integer quadratic programming | 2018-10-26 | Paper |
| Ellipsoidal mixed-integer representability | 2018-10-26 | Paper |
| Aggregation-based cutting-planes for packing and covering integer programs | 2018-09-28 | Paper |
| On decomposability of multilinear sets | 2018-08-22 | Paper |
| Totally Unimodular Congestion Games | 2018-07-16 | Paper |
| The Multilinear Polytope for Acyclic Hypergraphs | 2018-04-24 | Paper |
| On matrices with the Edmonds-Johnson property arising from bidirected graphs | 2018-04-18 | Paper |
| A Polyhedral Study of Binary Polynomial Programs | 2017-06-02 | Paper |
| Mixed-integer quadratic programming is in NP | 2017-03-23 | Paper |
| On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming | 2016-08-10 | Paper |
| On the Mixed Binary Representability of Ellipsoidal Regions | 2016-08-10 | Paper |
| Relaxations of mixed integer sets from lattice-free polyhedra | 2016-07-22 | Paper |
| Minimizing cubic and homogeneous polynomials over integers in the plane | 2016-05-19 | Paper |
| On the diameter of lattice polytopes | 2016-05-12 | Paper |
| Reverse split rank | 2015-12-09 | Paper |
| Reverse Chvátal--Gomory Rank | 2015-11-27 | Paper |
| Disjunctive programming and relaxations of polyhedra | 2014-06-02 | Paper |
| Reverse Split Rank | 2014-06-02 | Paper |
| On the convergence of the affine hull of the Chvàtal-Gomory closures | 2014-01-21 | Paper |
| Reverse Chvátal--Gomory Rank | 2013-03-19 | Paper |
| Relaxations of mixed integer sets from lattice-free polyhedra | 2012-12-07 | Paper |
| Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes | 2012-11-02 | Paper |
| On convergence in mixed integer programming | 2012-10-15 | Paper |
| A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts | 2012-07-13 | Paper |
| On the rank of disjunctive cuts | 2012-05-24 | Paper |
| Half-Integral Vertex Covers on Bipartite Bidirected Graphs: Total Dual Integrality and Cut-Rank | 2010-08-27 | Paper |
| On matrices with the Edmonds-Johnson property | 2010-05-21 | Paper |
| A variable neighborhood descent algorithm for a real waste collection problem with mobile depots | 2006-09-14 | Paper |
