Aida Khajavirad

Math. Program., November, 2023

Linear Programming and Community Detection.

[BibT_eX]

[DOI]

Dmitriy Kunisky

Math. Oper. Res., May, 2023

On the strength of recursive McCormick relaxations for binary polynomial optimization.

[BibT_eX]

[DOI]

Oper. Res. Lett., March, 2023

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization.

[BibT_eX]

[DOI]

CoRR, 2023

2022

The Ratio-Cut Polytope and K-Means Clustering.

[BibT_eX]

[DOI]

Antonio De Rosa

SIAM J. Optim., 2022

Rank-one Boolean tensor factorization and the multilinear polytope.

[BibT_eX]

[DOI]

CoRR, 2022

2021

The Running Intersection Relaxation of the Multilinear Polytope.

[BibT_eX]

[DOI]

Math. Oper. Res., 2021

2020

On the impact of running intersection inequalities for globally solving polynomial optimization problems.

[BibT_eX]

[DOI]

Math. Program. Comput., 2020

2018

The Multilinear Polytope for Acyclic Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Optim., 2018

A hybrid LP/NLP paradigm for global optimization relaxations.

[BibT_eX]

[DOI]

Math. Program. Comput., 2018

On decomposability of Multilinear sets.

[BibT_eX]

[DOI]

Math. Program., 2018

2017

A Polyhedral Study of Binary Polynomial Programs.

[BibT_eX]

[DOI]

Math. Oper. Res., 2017

2015

Global optimization of nonconvex problems with multilinear intermediates.

[BibT_eX]

[DOI]

Xiaowei Bao

Mohit Tawarmalani

Math. Program. Comput., 2015

2014

Relaxations of factorable functions with convex-transformable intermediates.

[BibT_eX]

[DOI]

Jeremy J. Michalek

Math. Program., 2014

2013

Convex envelopes generated from finitely many compact convex sets.

[BibT_eX]

[DOI]

Math. Program., 2013

2012

Convex envelopes of products of convex and component-wise concave functions.

[BibT_eX]

[DOI]