Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 52, No. 3, May-June 2004, pp. 487-490
DOI: 10.1287/opre.1030.0099
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Atamtürk, A.
Right arrow Search for Related Content

Sequence Independent Lifting for Mixed-Integer Programming

Alper Atamtürk

Department of Industrial Engineering and Operations Research, University of California at Berkeley, Berkeley, California 94720-1777
atamturk{at}ieor.berkeley.edu

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.

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:


Home page
INFORMS Journal on ComputingHome page
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]


Home page
Mathematics of Operations ResearchHome page
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
Copyright © 2004 by INFORMS.