@Article{JCM-17-179,
author = {Zhang , Lian-ShengGao , Feng and Zhu , Wen-Xing},
title = {Nonlinear Integer Programming and Global Optimization},
journal = {Journal of Computational Mathematics},
year = {1999},
volume = {17},
number = {2},
pages = {179--190},
abstract = {<p style="text-align: justify;">Various approaches have been developed for solving a variety of continuous
global optimization problems. But up to now, less work has been devoted to solving
nonlinear integer programming problems due to the inherent difficulty. This paper manages to transform the general nonlinear integer programming problem into an &quot;equivalent&quot; special continuous global minimization problem. Thus any effective global optimization algorithm can be used to solve nonlinear integer programming problems. This result will also promote the research on global optimization. We present an interval Branch-and-Bound algorithm. Numerical experiments show that this approach is efficient. &nbsp;</p>},
issn = {1991-7139},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jcm/9092.html}
}