A disjunctive cutting plane procedure for general mixed-integer linear programs
暂无分享,去创建一个
[1] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .
[2] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[3] Sanjay Mehrotra,et al. A branch-and-cut method for 0-1 mixed convex programming , 1999, Math. Program..
[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] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..