This is a survey on the computational complexity of nonlinear mixed-integer optimization. It highlights a selection of important topics, ranging from incomputability results that arise from number theory and logic, to recently obtained fully polynomial time approximation schemes in fixed dimension, and to strongly polynomial-time algorithms for special cases.
CITATION STYLE
Köppe, M. (2012). On the Complexity of Nonlinear Mixed-Integer Optimization (pp. 533–557). https://doi.org/10.1007/978-1-4614-1927-3_19
Mendeley helps you to discover research relevant for your work.