The intersection cut paradigm is a powerful framework that facilitates the generation of valid
linear inequalities, or cutting planes, for a potentially complex set S. The key ingredients in …

The main problem of failing to recognize the redundant DCCs and DCyCs is that current
solvers do not yet have the prepossessing capabilities to recognize those redundancies. As …

Consider a quadratic set Q and two half-spaces A and B. If there exists a τ such that Q (τ)=
Q1 (τ)∪ Q2 (τ) is a non-convex quadratic cone, and its vertex v is contained in A or B but not …