Florent
Cadoux
Title:
Wolfe's projection algorithm applied to the computation of
disjunctive cuts
Abstract:
A cut is defined as an hyperplane that separates a point from a
polyhedron. Cuts are used for instance in the branch and cut algorithm
for mixed integer programming. In this case it is desirable for cuts to
be deep and facet defining. We propose an algorithm (based on Wolfe's
projection algorithm) to compute such cuts.