Preprints:  

• • A. De Rosa and A. Khajavirad, On the power of linear programming for K-means clustering.
    
    
  • A. Del Pia and A. Khajavirad, The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization.
    
    
  • A. De Rosa and A. Khajavirad, Explicit convex hull description of bivariate quadratic sets with indicator variables.
    
    
  • A. Khajavirad, The circle packing problem: a theoretical comparison of various convexification techniques. 

Published or accepted:

• • A. Khajavirad, On the strength of recursive McCormick relaxations for binary polynomial optimization, Operations Research Letters, https://doi.org/10.1016/j.orl.2023.01.009, 2023.

• • A. De Rosa and A. Khajavirad, Efficient Joint Object Matching via Linear Programming, Mathematical Programming Series A, DOI 10.1007/s10107-023-01932-w, 2023.

• • A. Del Pia, A. Khajavirad, and D. Kunisky, Linear programming and community detection, Mathematics of Operations Research, DOI 10.1287/moor.2022.1282, 2022.

• • A. De Rosa and A. Khajavirad, The ratio-cut polytope and K-means clustering, SIAM Journal on Optimization, 32(1): 173-203, 2022.

• • A. Del Pia and A. Khajavirad, The running intersection relaxation of the multilinear polytope, Mathematics of Operations Research, 46 (3): 1008-1037, 2021.

• • A. Del Pia, A. Khajavirad, and N. V. Sahinidis, On the impact of running intersection inequalities for globally solving polynomial optimization problems, Mathematical Programming Computation, 12(2): 165-191, 2020.  

• • A. Del Pia and A. Khajavirad, On decomposability of the multilinear polytope and its implications in mixed-integer nonlinear optimization, INFORMS OS Today, 8(2): 3-10, May 2018.                                                             

• • A. Khajavirad and N. V. Sahinidis, A hybrid LP/NLP paradigm for global optimization relaxations, Mathematical Programming Computation, 10 (3): 383-421, 2018. 2018.  

• • A. Del Pia and A. Khajavirad, The Multilinear Polytope for Acyclic Hypergraphs, SIAM Journal on Optimization, 28:1049–1076, 2018.                                

• • A. Del Pia and A. Khajavirad, On Decomposability of Multilinear Sets, Mathematical Programming Series A, 170 (2): 387-415, 2018.
    • • Awarded the 2017 INFORMS Optimization Society Prize for Young Researchers                                         

• • A. Del Pia and A. Khajavirad, A Polyhedral Study of Binary Polynomial Programs, Mathematics of Operations Research, 42(2): 389-410, 2017. 2017.                                                                                                        

• • X. Bao, A. Khajavirad, N. V. Sahinidis, and M. Tawarmalani, Global optimization of nonconvex problems with multilinear intermediates, Mathematical Programming Computation, 1-37, 2015.

• • A. Khajavirad, J. J. Michalek, and N. V. Sahinidis, Relaxations of factorable functions with convex-transformable intermediates, Mathematical Programming Series A, DOI 10.1007/s10107-012-0618-8, 2012. 

• • A. Khajavirad and N. V. Sahinidis, Convex envelopes generated from finitely many compact convex sets, Mathematical Programming Series A, DOI 10.1007/s10107-011-0496-5, 2013.   

• • A. Khajavirad and N. V. Sahinidis, Convex envelopes of products of convex and component-wise concave functions, Journal of Global Optimization, DOI 10.1007/s10898-011-9747-5, 2012.

• • A. Khajavirad and J. J. Michalek, A deterministic Lagrangian-based global optimization approach for decomposable nonconvex mixed-integer problems, ASME Journal of Mechanical Design, 131: 1-8, 2009.