论文信息 - On the Value of Binary Expansions for General Mixed-Integer Linear Programs

On the Value of Binary Expansions for General Mixed-Integer Linear Programs

We study the use of binary variables in reformulating general mixed-integer linear programs. We show that binary reformulations result in problems for which almost all the binary variables replacing a general integer variable need to be explored during branching. We also give computational results on the performance of such reformulations in solving the mixed-integer programs, which support our theoretical results.

Sanjay Mehrotra | Jonathan H. Owen | Sanjay Mehrotra

[1] E. Balas,et al. Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .

[2] Sanjay Mehrotra,et al. A branch-and-cut method for 0-1 mixed convex programming , 1999, Math. Program..

[3] Warren P. Adams,et al. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .

[4] Hanif D. Sherali,et al. A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..

[5] Sanjay Mehrotra,et al. A disjunctive cutting plane procedure for general mixed-integer linear programs , 2001, Math. Program..

[6] Hanif D. Sherali,et al. A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[7] Martin W. P. Savelsbergh,et al. An Updated Mixed Integer Programming Library: MIPLIB 3.0 , 1998 .

[8] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[9] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .