# On the complexity of nonlinear mixed-integer optimization

Source: [On the complexity of nonlinear mixed-integer optimization](<https://www.sota2.com/research/paper/68fa4ec51e209131ce95e458>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T09:58:50.956Z

Authors: Matthias K\\"oppe

Published: 2010-06-25T01:14:45.000Z

## 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1006.4895>)

[PDF](<https://arxiv.org/pdf/1006.4895.pdf>)
