On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width
暂无分享,去创建一个
[1] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[2] Thøger Bang,et al. A solution of the “plank problem.” , 1951 .
[3] Kent Andersen,et al. An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets , 2009, Math. Oper. Res..
[4] M. Joerg. k-disjunctive cuts and cutting plane algorithms for general mixed integer linear programs , 2008 .
[5] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .
[6] William J. Cook,et al. Chvátal closures for mixed integer programming problems , 1990, Math. Program..
[7] Claus-Peter Schnorr,et al. Geometry of Numbers and Integer Programming (Summary) , 1988, STACS.
[8] Gennadiy Averkov. On finitely generated closures in the theory of cutting planes , 2012, Discret. Optim..
[9] Sanjeeb Dash,et al. On the polyhedrality of cross and quadrilateral closures , 2016, Math. Program..
[10] Sanjeeb Dash,et al. Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra , 2012, Math. Program..
[11] Kent Andersen,et al. Split closure and intersection cuts , 2002, Math. Program..
[12] Matthias Köppe,et al. The triangle closure is a polyhedron , 2011, Math. Program..
[13] Sanjeeb Dash,et al. Lattice-free sets, branching disjunctions, and mixed-integer programming , 2012 .
[14] Laurence A. Wolsey,et al. Two row mixed-integer cuts via lifting , 2010, Math. Program..