Inspired by branch-and-bound and cutting plane proofs in mixed-integer
o...
In this paper, we study algorithmic questions concerning products of mat...
A binarization of a bounded variable x is a linear formulation with
vari...
We study the complexity of cutting planes and branching schemes from a
t...
We investigate the theoretical complexity of branch-and-bound (BB) and
c...
The 1-product of matrices S_1 ∈R^m_1 × n_1 and S_2 ∈R^m_2 × n_2 is the m...
Let G be an n-node graph without two disjoint odd cycles. The algorithm
...
Consider the family of graphs without k node-disjoint odd cycles, where ...