Cutting Planes from Wide Split Disjunctions

  title={Cutting Planes from Wide Split Disjunctions},
  author={Pierre Bonami and Andrea Lodi and Andrea Tramontani and Sven Wiese},
In this paper, we discuss an extension of split cuts that is based on widening the underlying disjunctions. That the formula for deriving intersection cuts based on splits can be adapted to this case has been known for a decade now. For the first time though, we present applications and computational results. We further provide some theory that supports our findings, discuss extensions with respect to cut strengthening procedures and present some ideas on how to use the wider disjunctions also… 

Non-Recursive Cut Generation

This dissertation focuses on the theoretical and computational development of new disjunctive cuts, introducing three techniques for efficiently generating a large number of strong cuts without recursion, and introducing V-polyhedral cuts for generating valid inequalities from general disjunctions.

A mixed-integer branching approach for very small formulations of disjunctive constraints

An important problem in optimization is the construction of mixed-integer programming (MIP) formulations of disjunctive constraints that are both strong and small. Motivated by lower bounds on the

Integer Programming and Combinatorial Optimization: 21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings

It is conjecture that every 4-wise intersecting clutter is non-ideal, and the proof is proved in the binary case using Jaeger's 8-flow theorem for graphs and Seymour's characterization of the binary matroids with the sums of circuits property.

On a Generalization of the Chvátal-Gomory Closure

It is shown that all points in a rational polyhedron that satisfy a strengthened version of Chvatal-Gomory inequalities that use 0–1 bounds on variables form a rationalpolyhedron.

Generalized Chvátal-Gomory closures for integer programs with bounds on variables

It is proved that the closure of a rational polyhedron obtained after applying the generalized Chvátal-Gomory inequalities is also a rationalpolyhedron.



Strengthening cuts for mixed integer programs

Split closure and intersection cuts

It is shown that the split closure of a Mixed Integer Linear Program can be obtained using only intersection cuts, and two different proofs of this result are given, one geometric and one algebraic.

Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts

This paper presents a simple and fast heuristic for improving the coefficients on the continuous variables in the mixed-integer Gomory cuts, and finds that on several test problems, reduce-and-split cuts can substantially enhance the performance of a branch- and-bound algorithm.

Intersection Cuts - A New Type of Cutting Planes for Integer Programming

The paper gives a simple formula for finding the equation of the hyperplane, discusses some ways of strengthening the cut, proposes an algorithm, and gives a finiteness proof.

Chvátal closures for mixed integer programming problems

A finite recursive procedure for generating the mixed integer hull of a polyhedron is obtained, analogous to the process of repeatedly taking Chvátal closures in the integer programming case.

Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

A combination of two new algorithms recently proved to outperform all previous methods for the exact solution of the 0-1 Knapsack Problem, where, in additi on, valid inequalities are generated and surrogate relaxed, and a new initial core problem is adopted.

On the interplay of Mixed Integer Linear, Mixed Integer Nonlinear and Constraint Programming

An algorithm for MILPs with indicator constraints that incorporates elements of CP into MIP techniques, including computational results for the JobShopScheduling problem and an extension of the class of MILPs so that linear expressions are allowed to have non-contiguous domains.

ILP and CP Formulations for the Lazy Bureaucrat Problem

This paper focuses on the Lazy Bureaucrat Problem (LBP), which is the lazy counterpart of the knapsack problem and the goal of a lazy bureaucrat is to schedule a least profitable subset of tasks.

A Branch-and-Price Algorithm for Multi-mode Resource Leveling

This work presents a branch-and-price approach together with a new heuristic to solve the more general turnaround scheduling problem, enabling it to optimally solve instances with 50 multi-mode jobs.