A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
暂无分享,去创建一个
[1] Friedrich Eisenbrand,et al. Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube , 1999, IPCO.
[2] Egon Balas,et al. programming: Properties of the convex hull of feasible points * , 1998 .
[3] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[4] E. Balas,et al. Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .
[5] E. Balas,et al. Strengthening cuts for mixed integer programs , 1980 .
[6] Gérard Cornuéjols,et al. On the rank of mixed 0,1 polyhedra , 2002, Math. Program..
[7] William J. Cook,et al. Chvátal closures for mixed integer programming problems , 1990, Math. Program..
[8] R. Gomory. AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .
[9] Egon Balas,et al. Lift-and-project for Mixed 0-1 programming: recent progress , 2002, Discret. Appl. Math..
[10] Martin W. P. Savelsbergh,et al. An Updated Mixed Integer Programming Library: MIPLIB 3.0 , 1998 .
[11] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[12] Laurence A. Wolsey,et al. A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..
[13] Egon Balas,et al. Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..