A family of polytopes in the 0/1-cube with Gomory-Chvátal rank at least ((1+1/6)n – 4)

  • Can Kizilkale
    • Categories Combinatorial Optimization, Integer Programming Tags , Short URL: https://optimization-online.org/?p=12097

    We provide a family of polytopes P in [0, 1]^n whose Gomory-Chvátal rank is at least ((1 + 1/6)n – 4).

    Citation

    Rutcor 640 Bartholomew Road Piscataway, NJ 08854-8003 , July,2012

    Article

    Download

    View PDF