Skip to content

Optimization Online

  • Welcome
  • Repository
  • Submit
  • About
  • Help
  • My Eprints

polytopes in 0/1-cube

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

Published: 2012/07/28
  • Can Kizilkale
  • Categories Combinatorial Optimization, Integer Programming Tags gomory–chvátal rank, polytopes in 0/1-cube

    We provide a family of polytopes P in [0, 1]^n whose Gomory-Chvátal rank is at least ((1 + 1/6)n – 4). CitationRutcor 640 Bartholomew Road Piscataway, NJ 08854-8003 , July,2012ArticleDownload View PDF

    Log in


    Repository

    Author List

    Months

    Categories

    Keywords

    alternating direction method of multipliers approximation algorithms augmented lagrangian method bilevel optimization Branch-and-Bound branch-and-cut chance constraints column generation combinatorial optimization complexity conic optimization convex optimization cutting planes decomposition derivative-free optimization distributionally robust optimization duality dynamic programming first-order methods global convergence global optimization heuristics integer programming interior point methods large-scale optimization linear programming machine learning mixed-integer linear programming mixed-integer nonlinear programming mixed-integer programming multiobjective optimization nonconvex optimization nonlinear optimization nonlinear programming nonsmooth optimization optimal control optimization proximal point algorithm quadratic programming robust optimization semidefinite programming stochastic optimization stochastic programming trust-region methods unconstrained optimization

    © 2025 Optimization Online • Child Theme of GeneratePress
    For feedback or questions, contact optonline@wid.wisc.edu.