Corpus ID: 119130319

On the complexity of nonlinear mixed-integer optimization

@inproceedings{Koppe2010OnTC,
  title={On the complexity of nonlinear mixed-integer optimization},
  author={Matthias Koppe},
  year={2010}
}
  • Matthias Koppe
  • Published 2010
  • Mathematics
  • This is a survey on the computational complexity of nonlinear mixedinteger 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 polynomialtime algorithms for special cases. 

    Figures from this paper.

    Semidefinite Approximation for Mixed Binary Quadratically Constrained Quadratic Programs
    • 7
    • Open Access
    On the complexity of quasiconvex integer minimization problem
    • 3
    • Open Access
    Scheduling Meets Fixed-Parameter Tractability
    • 4
    • Open Access
    Optimal dynamic formation control of multi-agent systems in constrained environments
    • 23
    • Open Access
    Resource Allocation Algorithms Supporting Coexistence of Cognitive Vehicular and IEEE 802.22 Networks
    • 20
    • Highly Influenced
    • Open Access
    Thermo-economic evaluation, optimization and synthesis of large-scale coal-fired power plants
    • 15
    • Open Access
    Decomposition Methods for Nonlinear Optimization and Data Mining

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 53 REFERENCES
    Integer Programming with a Fixed Number of Variables
    • 1,277
    • Open Access
    The complexity of approximating a nonlinear program
    • 134
    • Open Access
    Some optimal inapproximability results
    • 1,636
    • Open Access
    There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
    • 109
    • Highly Influential
    Nonlinear Integer Programming
    • 230
    • Open Access
    The complexity of optimizing over a simplex, hypercube or sphere: a short survey
    • 95
    • Open Access
    A faster strongly polynomial time algorithm for submodular function minimization
    • J. Orlin
    • Mathematics, Computer Science
    • 2009
    • 239
    • Open Access
    A polynomial oracle-time algorithm for convex integer minimization
    • 60
    • Open Access