Cardinality Cuts: New Cutting Planes for 0-1 Programming

  • Osman Oguz
    • Categories 0-1 Programming, Cutting Plane Approaches, Integer Programming Tags , Short URL: https://optimization-online.org/?p=9087

    We present new valid inequalities that work in similar ways to well known cover inequalities.The differences exist in three aspects. First difference is in the generation of the inequalities. The method used in generation of the new cuts is more practical in contrast to classical cover inequalities. Second difference is the more general applicability, i.e., being useful for problems like TSP. The third aspect is superior efficiency as indicated by our preliminary experiments.

    Citation

    Dept. of Industrial Engineering, Bilkent University, Ankara, Turkey.(November 2006)

    Article

    Download

    View Cardinality Cuts: New Cutting Planes for 0-1 Programming