On the complexity of nonlinear mixed-integer optimization
classification
🧮 math.OC
keywords
complexitymixed-integernonlinearoptimizationalgorithmsapproximationarisecases
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.