On the separation of maximally violated mod-k cuts

@article{Caprara2000OnTS,
  title={On the separation of maximally violated mod-k cuts},
  author={Alberto Caprara and Matteo Fischetti and Adam N. Letchford},
  journal={Mathematical Programming},
  year={2000},
  volume={87},
  pages={37-56}
}
  • Alberto Caprara, Matteo Fischetti, Adam N. Letchford
  • Published in Math. Program. 2000
  • Computer Science, Mathematics
  • Mathematical Programming
  • Abstract.Separation is of fundamental importance in cutting-plane based techniques for Integer Linear Programming (ILP). In recent decades, a considerable research effort has been devoted to the definition of effective separation procedures for families of well-structured cuts. In this paper we address the separation of Chvátal rank-1 inequalities in the context of general ILP’s of the form min{cTx:Ax≤b,x integer}, where A is an m×n integer matrix and b an m-dimensional integer vector. In… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Figures and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 46 CITATIONS

    Addressing Geographic Uncertainty In Spatial Optimization

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    New results on the Windy Postman Problem

    VIEW 5 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Embedding {0, }-Cuts in a Branch-and-Cut Framework: A Computational Study

    VIEW 5 EXCERPTS
    CITES BACKGROUND

    Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem

    VIEW 10 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Binary clutter inequalities for integer programs

    VIEW 10 EXCERPTS
    CITES METHODS & BACKGROUND

    Polynomial-Time Separation of Simple Comb Inequalities

    VIEW 7 EXCERPTS
    CITES BACKGROUND

    Totally tight Chv"atal-Gomory cuts

    VIEW 4 EXCERPTS
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 28 REFERENCES

    The graphical relaxation: A new framework for the symmetric traveling salesman polytope

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Facets of the Asymmetric Traveling Salesman Polytope

    VIEW 4 EXCERPTS

    A new approach to the minimum cut problem

    VIEW 1 EXCERPT

    Gomory cuts revisited

    VIEW 1 EXCERPT