|
|
||||||||
Department of Industrial Engineering and Operations Research, University of California at Berkeley, Berkeley, California 94720-1777
We show that superadditive lifting functions lead to sequence independent lifting of inequalities for general mixed-integer programming. As an application, we note that mixed-integer rounding (MIR) may be viewed as sequence independent lifting. Consequently, we obtain facet conditions for MIR inequalities for mixed-integer knapsacks.
atamturk{at}ieor.berkeley.edu
Subject classifications: integer programming; theory, superadditive functions, lifting, facets.
History: Received November 2001;
revision received November 2002; revision received May 2003;
accepted June 2003.
This article has been cited by other articles:
![]() |
S. S. Dey and J.-P. Richard Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms INFORMS Journal on Computing, January 1, 2009; 21(1): 137 - 150. [Abstract] [PDF] |
||||
![]() |
A. Atamturk and M. Zhang The Flow Set with Partial Order Mathematics of Operations Research, August 1, 2008; 33(3): 730 - 746. [Abstract] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |