10 citations · 14 across the 14 of their papers we have counts for
3 papers · 1 filter
Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials
Christopher Hojny, Marc E. Pfetsch, Matthias Walter
Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given pol…
Persistency of Linear Programming Relaxations for the Stable Set Problem
Elisabeth Rodríguez-Heck, Karl Stickler, Matthias Walter +1
The Nemhauser-Trotter theorem states that the standard linear programming (LP) formulation for the stable set problem has a remarkable property, also known as (weak) persistency: f…
The Almost-Disjoint 2-Path Decomposition Problem
Annika Thome, Matthias Walter
We consider the problem of decomposing a given (di)graph into paths of length 2 with the additional restriction that no two such paths may have more than one vertex in common. We e…