On the complexity of nonlinear mixed-integer optimization
Skip to main content
eScholarship
Open Access Publications from the University of California

On the complexity of nonlinear mixed-integer optimization

  • Author(s): Köppe, Matthias
  • et al.

Published Web Location

https://arxiv.org/pdf/1006.4895.pdf
No 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.

Item not freely available? Link broken?
Report a problem accessing this item