Skip to main content
On the complexity of nonlinear mixed-integer optimization
Published Web Location
https://arxiv.org/pdf/1006.4895.pdfNo data is associated with this publication.
Abstract
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.