1. Convex separable optimization is not much harder than linear optimization;Hochbaum;J. Assoc. Comput. Mach.,1990
2. A polynomial oracle-time algorithm for convex integer minimization;Hemmecke;Math. Program.,2011
3. M. Koutecký, A. Levin, S. Onn, A parameterized strongly polynomial algorithm for block structured integer programs, in: Proceedings of ICALP 2018, Leibniz International Proceedings in Informatics, 2018, vol. 107-85, pp. 1–14.
4. Nonlinear discrete optimization;Onn,2010
5. An efficient polynomial time approximation scheme for load balancing on uniformly related machines;Epstein;Math. Program.,2014