An efficient decomposed multiobjective genetic algorithm for solving the joint product platform selection and product family design problem with generalized commonality A Khajavirad, JJ Michalek, TW Simpson Structural and Multidisciplinary Optimization 39, 187-201, 2009 | 115* | 2009 |

A hybrid LP/NLP paradigm for global optimization relaxations A Khajavirad, NV Sahinidis Mathematical Programming Computation 10 (3), 383-421, 2018 | 97 | 2018 |

A decomposed gradient-based approach for generalized platform selection and variant design in product family optimization A Khajavirad, JJ Michalek | 89* | 2008 |

Convex envelopes generated from finitely many compact convex sets A Khajavirad, NV Sahinidis Mathematical Programming 137 (1), 371-408, 2013 | 63 | 2013 |

Global optimization of nonconvex problems with multilinear intermediates X Bao, A Khajavirad, NV Sahinidis, M Tawarmalani Mathematical Programming Computation 7 (1), 1-37, 2015 | 57 | 2015 |

Convex envelopes of products of convex and component-wise concave functions A Khajavirad, NV Sahinidis Journal of global optimization 52 (3), 391-409, 2012 | 55 | 2012 |

A polyhedral study of binary polynomial programs A Del Pia, A Khajavirad Mathematics of Operations Research, 2017 | 53 | 2017 |

The multilinear polytope for acyclic hypergraphs A Del Pia, A Khajavirad SIAM Journal on Optimization 28 (2), 1049-1076, 2018 | 49 | 2018 |

A deterministic Lagrangian-based global optimization approach for quasiseparable nonconvex mixed-integer nonlinear programs A Khajavirad, JJ Michalek Journal of mechanical design 131 (5), 051009, 2009 | 32* | 2009 |

On decomposability of multilinear sets A Del Pia, A Khajavirad Mathematical Programming 170 (2), 387-415, 2018 | 31 | 2018 |

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

On the impact of running intersection inequalities for globally solving polynomial optimization problems A Del Pia, A Khajavirad, NV Sahinidis Mathematical programming computation 12 (2), 165-191, 2020 | 25 | 2020 |

Relaxations of factorable functions with convex-transformable intermediates A Khajavirad, JJ Michalek, NV Sahinidis Mathematical Programming 144 (1), 107-140, 2014 | 21 | 2014 |

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

On the strength of recursive McCormick relaxations for binary polynomial optimization A Khajavirad Operations Research Letters 51 (2), 146-152, 2023 | 7 | 2023 |

Efficient joint object matching via linear programming A De Rosa, A Khajavirad Mathematical Programming 202 (1), 1-46, 2023 | 6 | 2023 |

Linear programming and community detection A Del Pia, A Khajavirad, D Kunisky Mathematics of Operations Research 48 (2), 885-913, 2023 | 6 | 2023 |

Explicit convex hull description of bivariate quadratic sets with indicator variables A De Rosa, A Khajavirad arXiv preprint arXiv:2208.08703, 2022 | 5 | 2022 |

A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs A Del Pia, A Khajavirad Mathematical Programming, 1-33, 2023 | 4* | 2023 |

Rank-one Boolean tensor factorization and the multilinear polytope A Del Pia, A Khajavirad arXiv preprint arXiv:2202.07053, 2022 | 3 | 2022 |