A note on the MIR closure and basic relaxations of polyhedra
暂无分享,去创建一个
[1] William J. Cook,et al. Chvátal closures for mixed integer programming problems , 1990, Math. Program..
[2] Kent Andersen,et al. Split closure and intersection cuts , 2002, Math. Program..
[3] Laurence A. Wolsey,et al. A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..
[4] Egon Balas,et al. Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..
[5] G. Nemhauser,et al. Integer Programming , 2020 .
[6] Andrea Lodi,et al. MIR closures of polyhedral sets , 2009, Math. Program..
[7] Hanif D. Sherali,et al. Disjunctive Programming , 2009, Encyclopedia of Optimization.
[8] Egon Balas,et al. A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming , 2003, Math. Program..