Integer Conic Function Minimization Based on the Comparison Oracle
暂无分享,去创建一个
[1] Sebastian Heinz,et al. Complexity of integer quasiconvex polynomial optimization , 2005, J. Complex..
[2] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[3] Raymond Hemmecke,et al. A polynomial oracle-time algorithm for convex integer minimization , 2007, Math. Program..
[4] Leonid Khachiyan,et al. Integer Optimization on Convex Semialgebraic Sets , 2000, Discret. Comput. Geom..
[5] Robert Weismantel,et al. Integer convex minimization by mixed integer linear optimization , 2014, Oper. Res. Lett..
[6] Hendrik W. Lenstra,et al. Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..
[7] Jesús A. De Loera,et al. Integer Polynomial Optimization in Fixed Dimension , 2006, Math. Oper. Res..
[8] S. I. Veselov,et al. Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice , 2018, Journal of Applied and Industrial Mathematics.
[9] S. Vempala,et al. Integer programming, lattice algorithms, and deterministic volume estimation , 2012 .
[10] Piotr Faliszewski,et al. Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting , 2020, Theor. Comput. Sci..
[11] John Darzentas,et al. Problem Complexity and Method Efficiency in Optimization , 1983 .
[12] Amitabh Basu,et al. Centerpoints: A Link between Optimization and Convex Geometry , 2015, SIAM J. Optim..
[13] Santosh S. Vempala,et al. Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings , 2010, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[14] S. Heinz. Quasiconvex functions can be approximated by quasiconvex polynomials , 2008 .
[15] Timm Oertel. Integer Convex Minimization in Low Dimensions , 2014 .
[16] Panos M. Pardalos,et al. On the complexity of quasiconvex integer minimization problem , 2018, Journal of Global Optimization.
[17] Matthias Köppe,et al. A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(nlogn) , 2010, Discret. Optim..
[18] John N. Tsitsiklis,et al. NP-hardness of deciding convexity of quartic polynomials and related problems , 2010, Math. Program..
[19] R. Weismantel,et al. Convex integer minimization in fixed dimension , 2012, 1203.4175.