Manuscripts
0/1 integer programming over polytopes of Chvátal rank one is as hard as lattice problems [OO] [arXiv]
Treewidth and the complexity of box-constrained quadratic programs, with A. Khajavirad [OO] [arXiv]
A quadratic upper bound on the Chvátal rank of polytopes in the 0/1-cube [OO] [arXiv]
Rational Jacobi rotations and the complexity of approximating mixed integer quadratic programming [pdf] [OO] [arXiv]
Projection-width as a structural parameter for discrete separable optimization [pdf] [OO] [arXiv]
A geometric characterization of unbounded integer cubic optimization problems via thin rays [pdf] [OO] [arXiv]
Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization, with A. Khajavirad [pdf] [arXiv]
A randomized algorithm for sparse PCA based on the basic SDP relaxation, with D. Zhou [pdf] [OO] [arXiv]
Accepted or published papers (journal papers and conference papers)
The complete edge relaxation for binary polynomial optimization, with A. Khajavirad, Mathematical Programming, Series A (2026) [pdf] [OO] [arXiv] [DOI]
A knowledge compilation take on binary polynomial optimization, with F. Capelli, S. Di Gregorio, Mathematical Programming, Series A (2026) [pdf] [arXiv] [DOI]
Factorized binary polynomial optimization, Mathematical Programming, Series A 219(1-2) 799-828 (2026) [pdf] [OO] [arXiv] [DOI]
A semidefinite programming relaxation for the sparse integer least squares problem, with D. Zhou, INFORMS Journal on Optimization 8(1) 22-40 (2026) [pdf] [OO] [arXiv] [DOI] [code]
Convex quadratic sets and the complexity of mixed integer convex quadratic programming, SIAM Journal on Optimization 35(3) 1822-1845 (2025) [pdf] [arXiv] [DOI]
Efficient sparse PCA via block-diagonalization, with D. Zhou, Y. Zhu, Proceedings of ICLR 2025 (2025) [pdf] [arXiv] [OpenReview]
The mixed integer trust region problem, Mathematical Programming, Series A 213(1-2) 699-736 (2025) [pdf] [arXiv] [DOI]
The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization, with A. Khajavirad, Mathematical Programming, Series A 212(1-2) 717-761 (2025) [pdf] [OO] [arXiv] [DOI]
New classes of facets for complementarity knapsack problems, with J. Linderoth, H. Zhu, Discrete Applied Mathematics 356 247-262 (2024) [pdf] [arXiv] [DOI]
Rank-one Boolean tensor factorization and the multilinear polytope, with A. Khajavirad, Mathematics of Operations Research 50(2) 1514-1554 (2025) [pdf] [OO] [arXiv] [DOI]
Aggregation of continuous preferences in one dimension, with D. Knop, A. Lassota, K. Sornat, N. Talmon, Proceedings of IJCAI 2024 2748-2756 (2024) [pdf] [DOI]
Relaxations and cutting planes for linear programs with complementarity constraints, with J. Linderoth, H. Zhu, Journal of Global Optimization 90(1) 27-51 (2024) [pdf] [OO] [arXiv] [DOI]
A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs, with A. Khajavirad, Mathematical Programming, Series A 207(1-2) 269-301 (2024) [pdf] [OO] [arXiv] [DOI]
Simple odd β-cycle inequalities for binary polynomial optimization, with M. Walter, Mathematical Programming, Series B 206(1-2) 203-238 (2024) [pdf] [arXiv] [DOI]
On the complexity of separating cutting planes for the knapsack polytope, with J. Linderoth, H. Zhu, Mathematical Programming, Series B 206(1-2) 33-59 (2024) [pdf] [arXiv] [DOI]
On the complexity of binary polynomial optimization over acyclic hypergraphs, with S. Di Gregorio, Algorithmica 85(8) 2189-2213 (2023) [pdf] [arXiv] [DOI]
An approximation algorithm for indefinite mixed integer quadratic programming, Mathematical Programming, Series A 201(1-2) 263-293 (2023) [pdf] [OO] [arXiv] [DOI] [talk]
k-median: exact recovery in the extended stochastic ball model, with M. Ma, Mathematical Programming, Series A 200(1) 357-423 (2023) [pdf] [arXiv] [DOI]
Clustering with queries under semi-random noise, with M. Ma, C. Tzamos, Proceedings of COLT 2022 PMLR 178 5278-5313 (2022) [pdf] [arXiv] [PMLR]
Linear programming and community detection, with A. Khajavirad, D. Kunisky, Mathematics of Operations Research 48(2) 885-913 (2023) [pdf] [OO] [arXiv] [DOI]
New classes of facets for complementarity knapsack problems, with J. Linderoth, H. Zhu, Proceedings of ISCO 2022 LNCS 13526 3-21 (2022) [pdf] [DOI]
Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation, with J. Linderoth, H. Zhu, Mathematical Programming, Series B 197(2) 847-875 (2023) [pdf] [OO] [DOI]
Complexity, exactness, and rationality in polynomial optimization, with D. Bienstock, R. Hildebrand, Mathematical Programming, Series B 197(2) 661-692 (2023) [pdf] [arXiv] [DOI]
On the complexity of separation from the knapsack polytope, with J. Linderoth, H. Zhu, Proceedings of IPCO 2022 LNCS 13265 168-180 (2022) [pdf] [OO] [DOI]
Simple odd β-cycle inequalities for binary polynomial optimization, with M. Walter, Proceedings of IPCO 2022 LNCS 13265 181-194 (2022) [pdf] [OO] [DOI]
Sparse PCA on fixed-rank matrices, Mathematical Programming, Series A 198(1) 139-157 (2023) [pdf] [OO] [arXiv] [DOI]
On the complexity of binary polynomial optimization over acyclic hypergraphs, with S. Di Gregorio, Proceedings of SODA 2022 2684-2699 (2022) [pdf] [OO] [DOI]
Proximity in concave integer quadratic programming, with M. Ma, Mathematical Programming, Series A 194(1-2) 871-900 (2022) [pdf] [OO] [arXiv] [DOI]
Multi-cover inequalities for totally-ordered multiple knapsack sets, with J. Linderoth, H. Zhu, Proceedings of IPCO 2021 LNCS 12707 193-207 (2021) [pdf] [OO] [DOI]
Complexity, exactness, and rationality in polynomial optimization, with D. Bienstock, R. Hildebrand, Proceedings of IPCO 2021 LNCS 12707 58-72 (2021) [pdf] [OO] [DOI]
Integer packing sets form a well-quasi-ordering, with D. Gijswijt, J. Linderoth, H. Zhu, Operations Research Letters 49(2) 226-230 (2021) [pdf] [OO] [arXiv] [DOI]
Short simplex paths in lattice polytopes, with C. Michini, Discrete & Computational Geometry 67(2) 503-524 (2022) [pdf] [OO] [arXiv] [DOI] [talk]
Chvátal rank in binary polynomial optimization, with S. Di Gregorio, INFORMS Journal on Optimization 3(4) 315-349 (2021) [pdf] [OO] [DOI]
The running intersection relaxation of the multilinear polytope, with A. Khajavirad, Mathematics of Operations Research 46(3) 1008-1037 (2021) [pdf] [OO] [DOI]
Subset selection in sparse matrices, with S.S. Dey, R. Weismantel, SIAM Journal on Optimization 30(2) 1173-1190 (2020) [pdf] [OO] [arXiv] [DOI]
Subdeterminants and concave integer quadratic programming, SIAM Journal on Optimization 29(4) 3154-3173 (2019) [pdf] [OO] [arXiv] [DOI]
On the impact of running intersection inequalities for globally solving polynomial optimization problems, with A. Khajavirad, N. Sahinidis, Mathematical Programming Computation 12(2) 165-191 (2020) [pdf] [OO] [DOI]
Lower bounds on the lattice-free rank for packing and covering integer programs, with M. Bodur, S.S. Dey, M. Molinaro, SIAM Journal on Optimization 29(1) 55-76 (2019) [pdf] [OO] [arXiv] [DOI]
Characterizations of mixed binary convex quadratic representable sets, with J. Poskin, Mathematical Programming, Series A 177(1-2) 371-394 (2019) [pdf] [OO] [DOI]
The multilinear polytope for acyclic hypergraphs, with A. Khajavirad, SIAM Journal on Optimization 28(2) 1049-1076 (2018) [pdf] [OO] [DOI]
On matrices with the Edmonds-Johnson property arising from bidirected graphs, with A. Musitelli, G. Zambelli, Journal of Combinatorial Theory, Series B 130 49-91 (2018) [pdf] [DOI]
Aggregation-based cutting-planes for packing and covering integer programs, with M. Bodur, S.S. Dey, M. Molinaro, S. Pokutta, Mathematical Programming, Series A 171(1-2) 331-359 (2018) [pdf] [OO] [arXiv] [DOI]
Ellipsoidal mixed-integer representability, with J. Poskin, Mathematical Programming, Series B 172(1-2) 351-369 (2018) [pdf] [OO] [DOI]
On approximation algorithms for concave mixed-integer quadratic programming, Mathematical Programming, Series B 172(1-2) 3-16 (2018) [pdf] [OO] [DOI]
On decomposability of multilinear sets, with A. Khajavirad, Mathematical Programming, Series A 170(2) 387-415 (2018) [pdf] [OO] [DOI]
Totally unimodular congestion games, with M. Ferris, C. Michini, Proceedings of SODA 2017 577-588 (2017) [pdf] [OO] [arXiv] [DOI]
A polyhedral study of binary polynomial programs, with A. Khajavirad, Mathematics of Operations Research 42(2) 389-410 (2017) [pdf] [OO] [DOI]
Mixed-integer quadratic programming is in NP, with S.S. Dey, M. Molinaro, Mathematical Programming, Series A 162(1-2) 225-240 (2017) [pdf] [OO] [arXiv] [DOI]
On the diameter of lattice polytopes, with C. Michini, Discrete & Computational Geometry 55(3) 681-687 (2016) [pdf] [OO] [arXiv] [DOI]
On approximation algorithms for concave mixed-integer quadratic programming, Proceedings of IPCO 2016 LNCS 9682 1-13 (2016) [pdf] [DOI]
On the mixed binary representability of ellipsoidal regions, with J. Poskin, Proceedings of IPCO 2016 LNCS 9682 214-225 (2016) [pdf] [DOI]
Relaxations of mixed integer sets from lattice-free polyhedra, with R. Weismantel, Annals of Operations Research 240(1) 95-117 (2016) [pdf] [DOI]
Minimizing cubic and homogeneous polynomials over integers in the plane, with R. Hildebrand, R. Weismantel, K. Zemmer, Mathematics of Operations Research 41(2) 511-530 (2016) [pdf] [OO] [arXiv] [DOI]
Reverse split rank, with M. Conforti, M. Di Summa, Y. Faenza, Mathematical Programming, Series B 154(1-2) 273-303 (2015) [pdf] [arXiv] [DOI]
Reverse Chvátal-Gomory rank, with M. Conforti, M. Di Summa, Y. Faenza, R. Grappe, SIAM Journal on Discrete Mathematics 29(1) 166-181 (2015) [pdf] [arXiv] [DOI]
Reverse split rank, with M. Conforti, M. Di Summa, Y. Faenza, Proceedings of IPCO 2014 LNCS 8494 234-248 (2014) [pdf] [DOI]
Integer quadratic programming in the plane, with R. Weismantel, Proceedings of SODA 2014 840-846 (2014) [pdf] [DOI]
On the convergence of the affine hull of the Chvátal-Gomory closures, with G. Averkov, M. Conforti, M. Di Summa, Y. Faenza, SIAM Journal on Discrete Mathematics 27(3) 1492-1502 (2013) [pdf] [arXiv] [DOI]
Reverse Chvátal-Gomory rank, with M. Conforti, M. Di Summa, Y. Faenza, R. Grappe, Proceedings of IPCO 2013 LNCS 7801 133-144 (2013) [pdf] [DOI]
Disjunctive programming and relaxations of polyhedra, with M. Conforti, Mathematical Programming, Series A 144(1-2) 307-314 (2014) [pdf] [DOI]
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes, with M. Baes, Y. Nesterov, S. Onn, R. Weismantel, Mathematical Programming, Series B 134(1) 305-322 (2012) [pdf] [DOI]
Relaxations of mixed integer sets from lattice-free polyhedra, with R. Weismantel, 4OR 10(3) 221-244 (2012) [pdf] [DOI]
On the rank of disjunctive cuts, Mathematics of Operations Research 37(2) 372-378 (2012) [pdf] [DOI]
On convergence in mixed integer programming, with R. Weismantel, Mathematical Programming, Series A 135(1-2) 397-412 (2012) [pdf] [DOI]
A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts, with C. Wagner, R. Weismantel, Operations Research Letters 39(4) 234-240 (2011) [pdf] [arXiv] [DOI]
On matrices with the Edmonds-Johnson property, 4OR 8(1) 105-108 (2010) [pdf] [DOI]
Half-integral vertex covers on bipartite bidirected graphs: total dual integrality and cut-rank, with G. Zambelli, SIAM Journal on Discrete Mathematics 23(3) 1281-1296 (2009) [pdf] [DOI]
A variable neighborhood descent algorithm for a real waste collection problem with mobile depots, with C. Filippi, International Transactions in Operational Research 13(2) 125-141 (2006) [pdf] [DOI]
Books or conference proceedings edited
A. Del Pia, V. Kaibel, editors. Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2023, Mathematical Programming, Series B 210, Springer (2025) [DOI]
A. Del Pia, V. Kaibel, editors. Integer Programming and Combinatorial Optimization, 24th International Conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023, Proceedings, LNCS 13904, Springer (2023) [DOI]
Newsletters
Extended formulations for the multilinear polytope of acyclic hypergraphs, with A. Khajavirad, INFORMS Computing Society Newsletter 4-9 (2025) [pdf] [arXiv] [INFORMS]
On decomposability of the multilinear polytope and its implications in mixed-integer nonlinear optimization, with A. Khajavirad, INFORMS OS Today 8(1) 3-10 (2018) [pdf] [OO] [INFORMS]
Disclaimer: the papers available on this webpage might slightly differ from the final printed version
Last updated on October 2026