Lattice Reformulation Cuts

Uses Software

NTL
CPLEX

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
On the separation of disjunctive cuts
A heuristic to generate rank-1 GMI cuts
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
Column basis reduction and decomposable knapsack problems
MIR closures of polyhedral sets
Lattice based extended formulations for integer linear equality systems
Chvátal closures for mixed integer programming problems
Valid inequalities for mixed integer linear programs
A hierarchy of polynomial time lattice basis reduction algorithms
Factoring polynomials with rational coefficients
On the separation of split cuts and related inequalities
Binary extended formulations of polyhedral mixed-integer sets
A relax-and-cut framework for Gomory mixed-integer cuts
A recursive procedure to generate all cuts for 0-1 mixed integer programs
On optimizing over lift-and-project closures
Optimizing over the split closure
Projected Chvátal-Gomory cuts for mixed integer linear programs
Some polyhedra related to combinatorial problems
Edmonds polytopes and a hierarchy of combinatorial problems
Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
Integer Programming with a Fixed Number of Variables
Integer Programming
An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
Intersection Cuts—A New Type of Cutting Planes for Integer Programming
Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs
Hard Equality Constrained Integer Knapsacks