Solving nonconvex nonlinear programming and mixed-integer nonlinear programming problems with adaptive random search

Abstract

ADVERTISEMENT RETURN TO ISSUEPREVArticleNEXTSolving nonconvex nonlinear programming and mixed-integer nonlinear programming problems with adaptive random searchR. L. SalcedoCite this: Ind. Eng. Chem. Res. 1992, 31, 1, 262–273Publication Date (Print):January 1, 1992Publication History Published online1 May 2002Published inissue 1 January 1992https://pubs.acs.org/doi/10.1021/ie00001a037https://doi.org/10.1021/ie00001a037research-articleACS PublicationsRequest reuse permissionsArticle Views565Altmetric-Citations70LEARN ABOUT THESE METRICSArticle Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to reflect usage leading up to the last few days.Citations are the number of other articles citing this article, calculated by Crossref and updated daily. Find more information about Crossref citation counts.The Altmetric Attention Score is a quantitative measure of the attention that a research article has received online. Clicking on the donut icon will load a page at altmetric.com with additional details about the score and the social media presence for the given article. Find more information on the Altmetric Attention Score and how the score is calculated. Share Add toView InAdd Full Text with ReferenceAdd Description ExportRISCitationCitation and abstractCitation and referencesMore Options Share onFacebookTwitterWechatLinked InRedditEmail Other access optionsGet e-Alertsclose Get e-Alerts