A. Khajavirad, A polynomial-time solvable class of sparse box-constrained polynomial optimization problems.
A. Khajavirad, Tight semidefinite programming relaxations for sparse box-constrained quadratic programs.
A. Del Pia and A. Khajavirad, Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization.
A. Del Pia and A. Khajavirad, The complete edge relaxation for binary polynomial optimization, Mathematical Programming Series A, accepted, 2026.
S. S. Dey and A. Khajavirad, A second-order cone representable class of nonconvex quadratic programs, Mathematical Programming Series A, DOI 10.1007/s10107-026-02364-y, 2026.
A. De Rosa and A. Khajavirad and Y. Wang, On the power of linear programming for K-means clustering, INFORMS Journal on Optimization, DOI 10.1287/ijoo.2025.0065, 2026.
A. Khajavirad and Y. Wang, Inference in higher-order undirected graphical models and binary polynomial optimization, INFORMS Journal on Computing, 38(1), 295-314, 2026.
A. Del Pia and A. Khajavirad, The pseudo–Boolean polytope and polynomial-size extended formulations for binary polynomial optimization, Mathematical Programming Series A, 212(1), 717-761, 2025.
A. Del Pia and A. Khajavirad, Rank-one Boolean tensor factorization and the multilinear polytope, Mathematics of Operations Research, 50(2), 1514-1554, 2025.
A. De Rosa and A. Khajavirad, Explicit convex hull description of bivariate quadratic sets with indicator variables, Mathematical Programming Series B, DOI 10.1007/s10107-024-02173-1, 2024.
A. Khajavirad, The circle packing problem: a theoretical comparison of various convexification techniques, Operations Research Letters, DOI 10.1016/j.orl.2024, 107197, 2024.
A. Del Pia and A. Khajavirad, A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs, Mathematical Programming Series A, 207, 269-301, 2023.
A. Khajavirad, On the strength of recursive McCormick relaxations for binary polynomial optimization, Operations Research Letters, 51(2), 146-152, 2023.
A. De Rosa and A. Khajavirad, Efficient Joint Object Matching via Linear Programming, Mathematical Programming Series A, 202(1), 1-46, 2023.
A. Del Pia, A. Khajavirad, and D. Kunisky, Linear programming and community detection, Mathematics of Operations Research, 48(2), 885-913, 2023.
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. 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.
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 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, 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 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.
A Del Pia and A Khajavirad, Extended formulations for the multilinear polytope of acyclic hypergraphs, INFORMS Computing Society Newsletter, 4-9, 2025.
A. Del Pia and A. Khajavirad, On decomposability of the multilinear polytope and its implications in mixed-integer nonlinear optimization, INFORMS Optimization Society Today, 8(1), 3-10, 2018.