Tightening simple mixed-integer sets with guaranteed bounds

  • Daniel Bienstock
  • Benjamin McClosky
    • Categories Combinatorial Optimization, Integer Programming Tags , Short URL: https://optimization-online.org/?p=10489

    We extend work on generating relaxations of simple sets with guaranteed bounds.

    Citation

    Unpublished. Columbia University, July 2008.

    Article

    Download

    Loading...