Skip to content

Optimization Online

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

Benjamin McClosky

Tightening simple mixed-integer sets with guaranteed bounds

Published: 2008/07/15, Updated: 2008/09/07
  • Daniel Bienstock
  • Benjamin McClosky
Categories Combinatorial Optimization, Integer Programming Tags integer programming, lifting

We extend work on generating relaxations of simple sets with guaranteed bounds. CitationUnpublished. Columbia University, July 2008.ArticleDownload View PDF

Log in


Repository

Author List

Months

Categories

Keywords

alternating direction method of multipliers augmented lagrangian method benders decomposition bilevel optimization Branch-and-Bound branch-and-cut chance constraints column generation combinatorial optimization complexity constrained 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

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