research
∙
11/09/2021
Helly systems and certificates in optimization
Inspired by branch-and-bound and cutting plane proofs in mixed-integer o...
share
research
∙
06/24/2021
Slack matrices, k-products, and 2-level polytopes
In this paper, we study algorithmic questions concerning products of mat...
research
∙
06/01/2021
Binary extended formulations and sequential convexification
A binarization of a bounded variable x is a linear formulation with vari...
research
∙
11/11/2020
Complexity of branch-and-bound and cutting planes in mixed-integer optimization – II
We study the complexity of cutting planes and branching schemes from a t...
research
∙
03/10/2020
Complexity of cutting planes and branch-and-bound in mixed-integer optimization
We investigate the theoretical complexity of branch-and-bound (BB) and c...
research
∙
02/06/2020
Recognizing Cartesian products of matrices and polytopes
The 1-product of matrices S_1 ∈R^m_1 × n_1 and S_2 ∈R^m_2 × n_2 is the m...
research
∙
11/27/2019
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
Let G be an n-node graph without two disjoint odd cycles. The algorithm ...
research
∙
08/17/2019
