Cyclic group and knapsack facets

@article{Aroz2003CyclicGA,
  title={Cyclic group and knapsack facets},
  author={Juli{\'a}n Ar{\'a}oz and Lisa Evans and Ralph E. Gomory and Ellis L. Johnson},
  journal={Mathematical Programming},
  year={2003},
  volume={96},
  pages={377-408}
}
Abstract. Any integer program may be relaxed to a group problem. We define the master cyclic group problem and several master knapsack problems, show the relationship between the problems, and give several classes of facet-defining inequalities for each problem, as well as a set of mappings that take facets from one type of master polyhedra to another. 

A Polyhedral Study of the Mixed Integer Cut

TLDR
The Gomory mixed integer cut is studied as a facet of the master cyclic group polyhedron and its extreme points and adjacent facets in this setting are characterized.

Corner Polyhedra and their connection with cutting planes

TLDR
Experiments are described that indicate the dominance of a relatively small number of the facets of Corner Polyhedra, which has implications for their value as cutting planes.

Valid inequalities for MIPs and group polyhedra from approximate liftings

TLDR
This scheme uses superadditive functions as the building block of integer and continuous lifting procedures and yields a simple derivation of new and known families of cuts that correspond to extreme inequalities for group problems.

Mixed-Integer Cuts from Cyclic Groups

TLDR
The lower bound value obtained when adding (implicitly) all the interpolated subadditive cuts that can be derived from the individual rows of an optimal LP tableau is computed, thus approximating the optimization over the so-called Gomory's Corner polyhedron.

Large scale group network optimization

TLDR
A minimal representation of the subadditive polytope for themaster cyclic group problem is discovered and a max °ow model on coveringspace is shown to be equivalent to the dual of shooting linear programming problem.

Cover and Pack Inequalities for (Mixed) Integer Programming

TLDR
An integer version of the cover inequalities are given and a necessary and sufficient facet condition for them are described, which generalizes the well-known facet condition of minimality of covers for 0-1 knapsacks.

On the strength of Gomory mixed-integer cuts as group cuts

TLDR
This paper numerically shows that once GMI cuts from different rows of the optimal simplex tableau are added to the formulation, all other group cuts from the same tableau rows are satisfied.

On a generalization of the master cyclic group polyhedron

TLDR
An explicit characterization of the polar of the nontrivial facet-defining inequalities for MEP is presented, which gives a polynomial time algorithm for separating an arbitrary point from MEP.
...

References

SHOWING 1-10 OF 13 REFERENCES

Some continuous functions related to corner polyhedra

TLDR
It is shown how faces previously generated and those given here can be used to give valid inequalities for any integer program.

Corner Polyhedra and their connection with cutting planes

TLDR
Experiments are described that indicate the dominance of a relatively small number of the facets of Corner Polyhedra, which has implications for their value as cutting planes.

Facets of the knapsack polytope

A necessary and sufficient condition is given for an inequality with coefficients 0 or 1 to define a facet of the knapsack polytope, i.e., of the convex hull of 0–1 points satisfying a given linear

Some polyhedra related to combinatorial problems

T-space and cutting planes

TLDR
It is shown how knowledge about T-space translates directly into cutting planes for general integer programming problems, and a variety of constructions for T- space facets are given, all of which translate intocutting planes, and continuous families of facets are introduced.

Some continuous functions related to corner polyhedra, II

TLDR
The group problem on the unit interval is developed, with and without continuous variables, and a class of functions is shown to give extreme valid inequalities for P-+(I, u0) and for certain subsetsU ofI.

Facet of regular 0–1 polytopes

TLDR
A special class of prime implicants is described for regular functions and it is shown that for anyP in this class,F(P) consists of one facet of H, and this facet has 0–1 coefficients, and every nontrivial facet ofH with 0-1 coefficients is obtained from this class.

Gomory cuts revisited

Contributions to the theory of games

The description for this book, Contributions to the Theory of Games (AM-40), Volume IV, will be forthcoming.

The Theory and Computation of Knapsack Functions

TLDR
This paper gives a characterization of knapsack functions and then uses the characterization to develop more efficient methods of computation.