Tightening simple mixed-integer sets with guaranteed bounds

Daniel Bienstock (danocolumbia.edu)
Benjamin McClosky (bjm4rice.edu)

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

Keywords: Integer Programming, Lifting

Category 1: Combinatorial Optimization

Category 2: Integer Programming

Citation: Unpublished. Columbia University, July 2008.

Download: [PDF]

Entry Submitted: 07/15/2008
Entry Accepted: 07/18/2008
Entry Last Modified: 09/07/2008

Modify/Update this entry