Convex envelopes of products of convex and component-wise concave functions. - Aida Khajavirad; Nikolaos V. Sahinidis (J. Glob. Optim., 2012)

Convex envelopes generated from finitely many compact convex sets. - Aida Khajavirad; Nikolaos V. Sahinidis (Math. Program., 2013)

Relaxations of factorable functions with convex-transformable intermediates. - Aida Khajavirad; Jeremy J. Michalek; Nikolaos V. Sahinidis (Math. Program., 2014)

Global optimization of nonconvex problems with multilinear intermediates. - Xiaowei Bao; Aida Khajavirad; Nikolaos V. Sahinidis; Mohit Tawarmalani (Math. Program. Comput., 2015)

A Polyhedral Study of Binary Polynomial Programs. - Alberto Del Pia; Aida Khajavirad (Math. Oper. Res., 2017)

On decomposability of Multilinear sets. - Alberto Del Pia; Aida Khajavirad (Math. Program., 2018)

A hybrid LP/NLP paradigm for global optimization relaxations. - Aida Khajavirad; Nikolaos V. Sahinidis (Math. Program. Comput., 2018)

The Multilinear Polytope for Acyclic Hypergraphs. - Alberto Del Pia; Aida Khajavirad (SIAM J. Optim., 2018)

On the impact of running intersection inequalities for globally solving polynomial optimization problems. - Alberto Del Pia; Aida Khajavirad; Nikolaos V. Sahinidis (Math. Program. Comput., 2020)

The Running Intersection Relaxation of the Multilinear Polytope. - Alberto Del Pia; Aida Khajavirad (Math. Oper. Res., 2021)

The Ratio-Cut Polytope and K-Means Clustering. - Antonio De Rosa; Aida Khajavirad (SIAM J. Optim., 2022)

On the strength of recursive McCormick relaxations for binary polynomial optimization. - Aida Khajavirad (Oper. Res. Lett., 2023)

Linear Programming and Community Detection. - Alberto Del Pia; Aida Khajavirad; Dmitriy Kunisky (Math. Oper. Res., 2023)

Efficient joint object matching via linear programming. - Antonio De Rosa; Aida Khajavirad (Math. Program., 2023)

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization. - Alberto Del Pia; Aida Khajavirad (CoRR, 2024)

The circle packing problem: A theoretical comparison of various convexification techniques. - Aida Khajavirad (Oper. Res. Lett., 2024)

A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs. - Alberto Del Pia; Aida Khajavirad (Math. Program., 2024)

Rank-One Boolean Tensor Factorization and the Multilinear Polytope. - Alberto Del Pia; Aida Khajavirad (Math. Oper. Res., 2025)

Extended formulations for the multilinear polytope of acyclic hypergraphs. - Alberto Del Pia; Aida Khajavirad (CoRR, 2025)

The complete edge relaxation for binary polynomial optimization. - Alberto Del Pia; Aida Khajavirad (CoRR, 2025)

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization. - Alberto Del Pia; Aida Khajavirad (Math. Program., 2025)