On the value of binary expansions for general mixed-integer linear programs

Operations Research

Volumn 50, Issue 5, 2002, Pages 810-819

  Owen, Jonathan H ^a   Mehrotra, Sanjay ^a  

^a GENERAL MOTORS CORPORATION   (United States)

Author keywords

Integer: remodeling of general integer variables; Programming

Indexed keywords

INTEGER PROGRAMMING; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

BINARY EXPANSIONS;

LINEAR PROGRAMMING;

EID: 0036759238     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.50.5.810.370     Document Type: Article

References (13)

1. Balas, E. 1979. Disjunctive programming. An. Discrete Math. 5 3-51.
2. _, S. Ceria, G. Cornuéols. 1993. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Programming 58 295-324.
3. _, _, _. 1996. Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management Sci. 42(9) 1229-1246.
4. Bazaraa, M.S., H.D. Sherali, C.M. Shetty. 1993. Nonlinear Programming Theory and Algorithms, 2nd ed. John Wiley and Sons, New York.
5. Bixby, R.E., S. Ceria, C.M. McZeal, M.W.P. Savelsbergh. 1998. An updated mixed integer programming library: MIPLIB 3.0. Technical Report TR98-03, The Department of Computational and Applied Mathematics, Rice University, Houston, TX.
6. Christof, T., A. Löebel. 1997. PORTA: Polyhedron representation transformation algorithm. Version 1.3.1 of the software and documentation distributed via the Internet 〈http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/soft.html〉.
7. ILOG Inc. 1998. Using the CPLEX Callable Library, Version 6.0. ILOG Inc.
8. Owen, J.H., S. Mehrotra. 2001. A disjunctive cutting plane procedure for general mixed-integer linear programs, Math. Programming 89(3) 437-448.
9. Rothberg, E. 2000. Using cuts to remove symmetry. Presentation at 17th International Symposium on Mathematical Programming, Atlanta, GA.
10. Sherali, H.D., W.P. Adams. 1990. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3) 411-430.
11. _, _. 1994. A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl. Math. 52 83-106.
12. _, _. 1999. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, Ch, 4. Kluwer Academic Publishers, Norwell, MA.
13. Stubbs, R.A., S. Mehrotra. 1999. A branch-and-cut method for 0-1 mixed convex programming. Math. Programming 86(3) 515-532.