Constructing lattice-free gradient polyhedra in dimension two
暂无分享,去创建一个
[1] Ignacio E. Grossmann,et al. An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1987, Math. Program..
[2] Stefan Weltge,et al. Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three , 2017, Math. Oper. Res..
[3] Alexander Barvinok,et al. A course in convexity , 2002, Graduate studies in mathematics.
[4] Egon Balas,et al. Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..
[5] Robert Weismantel,et al. Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three , 2010, Math. Oper. Res..
[6] Laurence A. Wolsey,et al. Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles , 2008, IPCO.
[7] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[8] Marco Di Summa,et al. A geometric approach to cut-generating functions , 2015, Mathematical Programming.
[9] Claus-Peter Schnorr,et al. Geometry of Numbers and Integer Programming (Summary) , 1988, STACS.
[10] Omprakash K. Gupta,et al. Branch and Bound Experiments in Convex Nonlinear Integer Programming , 1985 .
[11] M. Baes,et al. Mirror-Descent Methods in Mixed-Integer Convex Optimization , 2012, 1209.0686.
[12] Sven Leyffer,et al. Integrating SQP and Branch-and-Bound for Mixed Integer Nonlinear Programming , 2001, Comput. Optim. Appl..
[13] Gérard Cornuéjols,et al. Unique Minimal Liftings for Simplicial Polytopes , 2012, Math. Oper. Res..
[14] Gérard Cornuéjols,et al. An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..
[15] Alberto Del Pia,et al. Relaxations of mixed integer sets from lattice-free polyhedra , 2016, Ann. Oper. Res..
[16] David E. Bell. A Theorem Concerning the Integer Lattice , 1977 .
[17] Robert Weismantel,et al. Duality for mixed-integer convex minimization , 2014, Math. Program..
[18] Laurence A. Wolsey,et al. Inequalities from Two Rows of a Simplex Tableau , 2007, IPCO.
[19] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[20] Gérard Cornuéjols,et al. Maximal Lattice-Free Convex Sets in Linear Subspaces , 2010, Math. Oper. Res..
[21] H. Scarf. An observation on the structure of production sets with indivisibilities. , 1977, Proceedings of the National Academy of Sciences of the United States of America.
[22] Gérard Cornuéjols,et al. Optimality certificates for convex minimization and Helly numbers , 2017, Oper. Res. Lett..
[23] Jean-Paul Doignon,et al. Convexity in cristallographical lattices , 1973 .