Primal cutting plane algorithms revisited

@article{Letchford2002PrimalCP,
  title={Primal cutting plane algorithms revisited},
  author={Adam N. Letchford and Andrea Lodi},
  journal={Mathematical Methods of Operations Research},
  year={2002},
  volume={56},
  pages={67-81}
}
Abstract.Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research… 
Primal Integer Programming
Primal Cutting Plane Methods for the Traveling Salesman Problem
Most serious attempts at solving the traveling salesman problem (TSP) are based on the dual fractional cutting plane approach, which moves from one lower bound to the next. This thesis describes
Integral Simplex Using Decomposition with Primal Cuts
TLDR
It is shown that MRA canonically induces a decomposition of the augmentation problem and deepens the understanding of ISUD, and characterize cuts that adapt to this decomposition and relate them to primal cuts.
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
TLDR
A primal branch-and-cut algorithm that solves instances of the degree-constrained minimum spanning tree problem to optimality and turns out to be competitive with other methods known in the literature.
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming
TLDR
A possible implementation of a finite ABC algorithm that differs from standard branch-and-cut in several important ways, including the terms separation, branching, and fathoming take on new meanings in the primal context.
Primal separation algorithms
TLDR
The complexity of primal separation for several well-known classes of inequalities for various important combinatorial optimization problems, including the knapsack, stable set and travelling salesman problems are examined.
Integral Column Generation for Set Partitioning Problems with Side Constraints
TLDR
A new integral column generation algorithm that can solve efficiently large-scale set partitioning problems with side constraints is developed and the latter alter the quasi-integrality property needed for primal integral algorithms.
Integral simplex using double decomposition
TLDR
An integral simplex using double decomposition (ISU2D) is proposed, which uses an innovative disjoint vertical decomposition to find in parallel orthogonal descent directions leading to an integer solution with a larger improvement.
...
...

References

SHOWING 1-10 OF 39 REFERENCES
A Generated Cut for Primal Integer Programming
TLDR
This paper develops a new cutting plane for primal integer programming that has the property that the minimum of the simplex evaluators of the next tableau is strictly larger by an integer than the minimum for the current tableau.
A lift-and-project cutting plane algorithm for mixed 0–1 programs
We propose a cutting plane algorithm for mixed 0–1 programs based on a family of polyhedra which strengthen the usual LP relaxation. We show how to generate a facet of a polyhedron in this family
The integral basis method for integer programming
TLDR
An exact algorithm for solving integer programs, neither using cutting planes nor enumeration techniques, that relies on iteratively substituting one column by columns that correspond to irreducible solutions of certain linear diophantine inequalities.
Primal separation algorithms
TLDR
The complexity of primal separation for several well-known classes of inequalities for various important combinatorial optimization problems, including the knapsack, stable set and travelling salesman problems are examined.
A Simplified Primal (All-Integer) Integer Programming Algorithm
TLDR
The simplified primal algorithm makes these major amendments to the simplex method: a special row, indexed by L, is adjoined to the tableau and is periodically revised by a well-defined procedure.
Branch and cut algorithms
TLDR
This paper proposes a basic solution strategy to divide a region into a number of smaller regions and optimize the objective function over each smaller region individually, to ensure that an optimal solution to (1.1) is contained in at least one of the smaller regions that were generated.
A Bounding Minimization Problem for Primal Integer Programming
TLDR
An algorithm for obtaining an upper bound on the value of the objective function based on the best bound obtainable from dual solutions to a class of related linear programs is described.
A primal (all-integer) integer programming algorithm
The algorithm is most closely related to three existing procedures: the simplex method of G. B. Dantzig for linear programming problems, the Gumory all-integer integer programming algurithm, and the
Solving Multiple Knapsack Problems by Cutting Planes
TLDR
The inequalities that are described here serve as the theoretical basis for a cutting plane algorithm that is applied to practical problem instances arising in the design of main frame computers, in the layout of electronic circuits, and in sugar cane alcohol production.
A New Foundation for a Simplified Primal Integer Programming Algorithm
TLDR
A new foundation for a simplified primal integer programming algorithm is given, new choice rules are prescribed which guarantee finite convergence, and a criterion of optimality is introduced that permits the algorithm to terminate before dual feasibility is achieved.
...
...