Dirk Oliver Theis

A Faster Exact Separation Algorithm for Blossom Inequalities

In 1982, Padberg and Rao gave a polynomial-time separation algorithm for b-matching polyhedra. The current best known implementations of their separation algorithm run in \({\cal O}(|V|^2|E| \log (|V|^2/|E|))\) time when there are no edge capacities, but in \({\cal O}(|V||E|^2 \log (|V|^2/|E|))\) time when capacities are present.

Odd Minimum Cut Sets and

The famous Padberg-Rao separation algorithm for

b

b

-Matchings Revisited

-matching polyhedra can be implemented to run in

Symmetry matters for the sizes of extended formulations

\mathcal{O}(|V|^2|E|\log(|V|^2/|E|))

Compact formulations of the Steiner Traveling Salesman Problem and related problems

time in the uncapacitated case, and in

A Branch and Cut solver for the maximum stable set problem

\mathcal{O}(|V||E|^2\log(|V|^2/|E|))

The VPN Problem with Concave Costs

time in the capacitated case. We give a new and simple algorithm for the capacitated case which can be implemented to run in

Bivariate Partial Information Decomposition: The Optimization Perspective

\mathcal{O}(|V|^2|E|\log(|V|^2/|E|))

On the graphical relaxation of the symmetric traveling salesman polytope

time.