
Slack matrices, kproducts, and 2level polytopes
In this paper, we study algorithmic questions concerning products of mat...
read it

Binary extended formulations and sequential convexification
A binarization of a bounded variable x is a linear formulation with vari...
read it

Complexity of branchandbound and cutting planes in mixedinteger optimization – II
We study the complexity of cutting planes and branching schemes from a t...
read it

Complexity of cutting planes and branchandbound in mixedinteger optimization
We investigate the theoretical complexity of branchandbound (BB) and c...
read it

Recognizing Cartesian products of matrices and polytopes
The 1product of matrices S_1 ∈R^m_1 × n_1 and S_2 ∈R^m_2 × n_2 is the m...
read it

Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
Let G be an nnode graph without two disjoint odd cycles. The algorithm ...
read it

The stable set problem in graphs with bounded genus and bounded odd cycle packing number
Consider the family of graphs without k nodedisjoint odd cycles, where ...
read it
Michele Conforti
is this you? claim profile