Related papers: A Polynomial Time Algorithm for a Special Case of …

This paper has been withdrawn by the author.

This paper has been withdrawn. See quant-ph/9806031 for a discussion.

This preprint has been withdrawn.

This paper has been withdrawn by the authors, since it has been merged with Part I (ID 0802.3570)

This paper has been withdrawn by the author because it has been substantially modified.

This paper is withdrawn.

This paper has been withdrawn by the authors

This paper has been withdrawn.

Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject…

This paper has been withdrawn

This paper has been withdrawn by the author due to a serious mistake on Lemma 2.4.

The paper has been withdrawn

This paper has been withdrawn by the author due to a crucial error.

This paper has been withdrawn by the author.

This paper has been withdrawn

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…

It is well known that the most challenging question in optimization and discrete geometry is whether there is a strongly polynomial time simplex algorithm for linear programs (LPs). This paper gives a positive answer to this question by…

This paper has been withdrawn by the authors due to its publication

This article has been withdrawn by the authors

This paper has been withdrawn by the author.