On the complexity of nonlinear mixed-integer optimization

Details On the complexity of nonlinear mixed-integer optimization On the complexity of nonlinear mixed-integer optimization

2010-06-25

arxiv.org/abs/1006.4895v1

Mathematics

Optimization and Control

26 pages, 5 figures; to appear in: Mixed-Integer Nonlinear Optimization, IMA Volumes, Springer-Verlag

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the complexity of nonlinear mixed-integer optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the complexity of nonlinear mixed-integer optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the complexity of nonlinear mixed-integer optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-309541