Optimization Online


Tightening simple mixed-integer sets with guaranteed bounds

Daniel Bienstock (dano***at***columbia.edu)
Benjamin McClosky (bjm4***at***rice.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

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society