UnivTrevesV1, Istex, Corpus, bibRecord, 001175

Deterministic methods in constrained global optimization: Some recent advances and new fields of application

Identifieur interne : 001175 ( Istex/Corpus ); précédent : 001174; suivant : 001176

Deterministic methods in constrained global optimization: Some recent advances and new fields of application

Source :

Naval Research Logistics (NRL) [ 0894-069X ] ; 1990-08.

RBID : ISTEX:C5521E9E073E7BCDC732AF678375CE49A4108D14

Abstract

Recent developments in deterministic global optimization methods have considerably enlarged the fields of optimization where those methods can be successfully applied. It is the purpose of the present article to give a brief survey of both some of the most promising methods and new fields of application. The methods considered comprise branch and bound and outer approximation as well as combinations of branch and bound with outer approximation. The fields of applications to be discussed include concave minimization, reverse convex programming, d.c. programming, Lipschitzian optimization, systems of equations, and (or) inequalities and global integer programming.

Url:

https://api.istex.fr/document/C5521E9E073E7BCDC732AF678375CE49A4108D14/fulltext/pdf

DOI: 10.1002/1520-6750(199008)37:4<433::AID-NAV3220370403>3.0.CO;2-2

Links to Exploration step

ISTEX:C5521E9E073E7BCDC732AF678375CE49A4108D14

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Deterministic methods in constrained global optimization: Some recent advances and new fields of application</title>
<author><name sortKey="Horst, Reiner" sort="Horst, Reiner" uniqKey="Horst R" first="Reiner" last="Horst">Reiner Horst</name>
<affiliation><mods:affiliation>Fachbereich IV—Mathematik, Universitaet Trier, Postfach 3825, D‐55 Trier, Federal Republic of Germany</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:C5521E9E073E7BCDC732AF678375CE49A4108D14</idno>
<date when="1990" year="1990">1990</date>
<idno type="doi">10.1002/1520-6750(199008)37:4<433::AID-NAV3220370403>3.0.CO;2-2</idno>
<idno type="url">https://api.istex.fr/document/C5521E9E073E7BCDC732AF678375CE49A4108D14/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001175</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001175</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Deterministic methods in constrained global optimization: Some recent advances and new fields of application</title>
<author><name sortKey="Horst, Reiner" sort="Horst, Reiner" uniqKey="Horst R" first="Reiner" last="Horst">Reiner Horst</name>
<affiliation><mods:affiliation>Fachbereich IV—Mathematik, Universitaet Trier, Postfach 3825, D‐55 Trier, Federal Republic of Germany</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Naval Research Logistics (NRL)</title>
<title level="j" type="abbrev">Naval Research Logistics</title>
<idno type="ISSN">0894-069X</idno>
<idno type="eISSN">1520-6750</idno>
<imprint><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher>
<pubPlace>New York</pubPlace>
<date type="published" when="1990-08">1990-08</date>
<biblScope unit="volume">37</biblScope>
<biblScope unit="issue">4</biblScope>
<biblScope unit="page" from="433">433</biblScope>
<biblScope unit="page" to="471">471</biblScope>
</imprint>
<idno type="ISSN">0894-069X</idno>
</series>
<idno type="istex">C5521E9E073E7BCDC732AF678375CE49A4108D14</idno>
<idno type="DOI">10.1002/1520-6750(199008)37:4<433::AID-NAV3220370403>3.0.CO;2-2</idno>
<idno type="ArticleID">NAV3220370403</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0894-069X</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Recent developments in deterministic global optimization methods have considerably enlarged the fields of optimization where those methods can be successfully applied. It is the purpose of the present article to give a brief survey of both some of the most promising methods and new fields of application. The methods considered comprise branch and bound and outer approximation as well as combinations of branch and bound with outer approximation. The fields of applications to be discussed include concave minimization, reverse convex programming, d.c. programming, Lipschitzian optimization, systems of equations, and (or) inequalities and global integer programming.</div>
</front>
</TEI>
<istex><corpusName>wiley</corpusName>
<author><json:item><name>Reiner Horst</name>
<affiliations><json:string>Fachbereich IV—Mathematik, Universitaet Trier, Postfach 3825, D‐55 Trier, Federal Republic of Germany</json:string>
</affiliations>
</json:item>
</author>
<articleId><json:string>NAV3220370403</json:string>
</articleId>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>article</json:string>
</originalGenre>
<abstract>Recent developments in deterministic global optimization methods have considerably enlarged the fields of optimization where those methods can be successfully applied. It is the purpose of the present article to give a brief survey of both some of the most promising methods and new fields of application. The methods considered comprise branch and bound and outer approximation as well as combinations of branch and bound with outer approximation. The fields of applications to be discussed include concave minimization, reverse convex programming, d.c. programming, Lipschitzian optimization, systems of equations, and (or) inequalities and global integer programming.</abstract>
<qualityIndicators><score>6.14</score>
<pdfVersion>1.3</pdfVersion>
<pdfPageSize>504 x 720 pts</pdfPageSize>
<refBibsNative>true</refBibsNative>
<abstractCharCount>670</abstractCharCount>
<pdfWordCount>15645</pdfWordCount>
<pdfCharCount>85317</pdfCharCount>
<pdfPageCount>39</pdfPageCount>
<abstractWordCount>95</abstractWordCount>
</qualityIndicators>
<title>Deterministic methods in constrained global optimization: Some recent advances and new fields of application</title>
<refBibs><json:item><author><json:item><name>E. L. Allgower</name>
</json:item>
<json:item><name>K. Georg</name>
</json:item>
</author>
<host><volume>22</volume>
<pages><last>85</last>
<first>28</first>
</pages>
<author></author>
<title>SIAM Review</title>
</host>
<title>Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations</title>
</json:item>
<json:item><author><json:item><name>F. Al‐Khayyal</name>
</json:item>
</author>
<host><volume>24</volume>
<pages><last>227</last>
<first>216</first>
</pages>
<author></author>
<title>European Journal of Operational Research</title>
</host>
<title>Linear, Quadratic, and Bilinear Programming Approaches to the Linear Complementarity Problem</title>
</json:item>
<json:item><author><json:item><name>F. Al‐Khayyal</name>
</json:item>
</author>
<host><volume>31</volume>
<pages><last>20</last>
<first>1</first>
</pages>
<author></author>
<title>Mathematical Programming Study</title>
</host>
<title>An Implicit Enumeration Procedure for the General Linear Complementarity Problem</title>
</json:item>
<json:item><author><json:item><name>F. Al‐Khayyal</name>
</json:item>
<json:item><name>J. E. Falk</name>
</json:item>
</author>
<host><volume>8</volume>
<pages><last>286</last>
<first>273</first>
</pages>
<author></author>
<title>Mathematics of Operations Research</title>
</host>
<title>Jointly Constrained Biconvex Programming</title>
</json:item>
<json:item><host><author></author>
<title>Annals of Operations Research</title>
</host>
</json:item>
<json:item><author><json:item><name>M. Avriel</name>
</json:item>
</author>
<host><pages><last>320</last>
<first>307</first>
</pages>
<author></author>
<title>Optimization and Design</title>
</host>
<title>Methods for Solving Signomial and Reverse Convex Programming Problems</title>
</json:item>
<json:item><host><author></author>
<title>Avriel, M.,Nonlinear Programming: Analysis and Methods,Prentice Hall Inc., Englewood Cliffs, NJ,1976.</title>
</host>
</json:item>
<json:item><author><json:item><name>M. Avriel</name>
</json:item>
<json:item><name>A. C. Williams</name>
</json:item>
</author>
<host><volume>19</volume>
<pages><last>141</last>
<first>125</first>
</pages>
<author></author>
<title>SIAM Journal of Applied Mathematics</title>
</host>
<title>Complementary Geometric Programming</title>
</json:item>
<json:item><author><json:item><name>M. Avriel</name>
</json:item>
<json:item><name>I. Zang</name>
</json:item>
</author>
<host><author></author>
<title>Generalized Concavity in Optimization and Economics</title>
</host>
<title>Generalized Arcwise Connected Functions and Characterizations of Local‐Global Minimum Properties</title>
</json:item>
<json:item><author><json:item><name>E. Balas</name>
</json:item>
</author>
<host><volume>2</volume>
<pages><last>332</last>
<first>330</first>
</pages>
<author></author>
<title>Mathematical Programming</title>
</host>
<title>Integer Programming and Convex Analysis: Intersection Cuts from Outer Polars</title>
</json:item>
<json:item><author><json:item><name>E. Balas</name>
</json:item>
</author>
<host><volume>28</volume>
<pages><last>349</last>
<first>335</first>
</pages>
<author></author>
<title>SIAM Journal of Applied Mathematics</title>
</host>
<title>Nonconvex Quadratic Programming via Generalized Polars</title>
</json:item>
<json:item><author><json:item><name>P. P. Bansal</name>
</json:item>
<json:item><name>S. E. Jacobsen</name>
</json:item>
</author>
<host><volume>15</volume>
<pages><last>564</last>
<first>549</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Applications</title>
</host>
<title>Characterization of Local Solutions for a Class of Nonconvex Programming</title>
</json:item>
<json:item><author><json:item><name>P. P. Bansal</name>
</json:item>
<json:item><name>S. E. Jacobsen</name>
</json:item>
</author>
<host><volume>15</volume>
<pages><last>586</last>
<first>565</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Applications</title>
</host>
<title>An Algorithm for Optimizing Network Flow Capacity Under Economies of Scale</title>
</json:item>
<json:item><author><json:item><name>J. Bard</name>
</json:item>
<json:item><name>J. E. Falk</name>
</json:item>
</author>
<host><volume>9</volume>
<pages><last>159</last>
<first>153</first>
</pages>
<author></author>
<title>Computers and Operations Research</title>
</host>
<title>A Separable Programming Approach to the Linear Complementarity Problem</title>
</json:item>
<json:item><author><json:item><name>H. P. Benson</name>
</json:item>
</author>
<host><volume>36</volume>
<pages><last>134</last>
<first>129</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Applications</title>
</host>
<title>On the Convergence of Two Branch‐and‐Bound Algorithms for Nonconvex Programming Problems</title>
</json:item>
<json:item><author><json:item><name>H. P. Benson</name>
</json:item>
</author>
<host><volume>38</volume>
<pages><last>340</last>
<first>319</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Applications</title>
</host>
<title>Algorithms for Parametric Nonconvex Programming</title>
</json:item>
<json:item><author><json:item><name>H. P. Benson</name>
</json:item>
</author>
<host><volume>32</volume>
<pages><last>177</last>
<first>165</first>
</pages>
<author></author>
<title>Naval Research Logistics Quarterly</title>
</host>
<title>A Finite Algorithm for Concave Minimization Over a Polyhedron</title>
</json:item>
<json:item><author><json:item><name>H. P. Benson</name>
</json:item>
<json:item><name>S. S. Erenguc</name>
</json:item>
</author>
<host><volume>59</volume>
<pages><last>246</last>
<first>223</first>
</pages>
<issue>2</issue>
<author></author>
<title>Journal of Optimization Theory and Applications</title>
</host>
<title>Using Convex Envelopes to Solve the Interactive Fixed Charge Linear Programming Problem</title>
</json:item>
<json:item><host><author></author>
<title>An Algorithm for Concave Integer Minimization Over a Polyhedron</title>
</host>
</json:item>
<json:item><host><author></author>
<title>Computers and Mathematics with Applications</title>
</host>
</json:item>
<json:item><host><author></author>
<title>Nauka, Novosibirsk</title>
</host>
</json:item>
<json:item><author><json:item><name>C. A. Burdet</name>
</json:item>
</author>
<host><volume>20</volume>
<pages><last>24</last>
<first>13</first>
</pages>
<author></author>
<title>Naval Research Logistics Quarterly</title>
</host>
<title>Polaroids: A New Tool on Nonconvex and Integer Programming</title>
</json:item>
<json:item><author><json:item><name>A. V. Cabot</name>
</json:item>
</author>
<host><volume>21</volume>
<pages><last>274</last>
<first>265</first>
</pages>
<author></author>
<title>Naval Research Logistics Quarterly</title>
</host>
<title>Variations on a Cutting Plane Method for Solving Concave Minimization Problems with Linear Constraints</title>
</json:item>
<json:item><author><json:item><name>A. V. Cabot</name>
</json:item>
<json:item><name>S. S. Erenguc</name>
</json:item>
</author>
<host><volume>33</volume>
<pages><last>567</last>
<first>559</first>
</pages>
<author></author>
<title>Naval Research Logistics Quarterly</title>
</host>
<title>A Branch and Bound Algorithm for Solving a Class of Nonlinear Integer Programming Problems</title>
</json:item>
<json:item><author><json:item><name>E. W. Cheney</name>
</json:item>
<json:item><name>A. A. Goldstein</name>
</json:item>
</author>
<host><volume>1</volume>
<pages><last>268</last>
<first>253</first>
</pages>
<author></author>
<title>Numerische Mathematik</title>
</host>
<title>Newton's Method for Convex Programming and Tchebycheff Approximation</title>
</json:item>
<json:item><host><author></author>
<title>A Class of Nonlinear Programming Test Problems</title>
</host>
</json:item>
<json:item><author><json:item><name>M. Cooper</name>
</json:item>
</author>
<host><volume>27</volume>
<pages><last>361</last>
<first>353</first>
</pages>
<author></author>
<title>Management Science</title>
</host>
<title>Survey of Methods for Pure Nonlinear Integer Programming</title>
</json:item>
<json:item><host><volume>22</volume>
<author></author>
<title>Dixon, L. C. W. andSzego, G. P., Eds.,Towards Global Optimization,North‐Holland, Amsterdam,1975,Vol. I.</title>
</host>
</json:item>
<json:item><host><volume>22</volume>
<author></author>
<title>Dixon, L. C. W. andSzego, G. P., Eds.,Towards Global Optimization,North‐Holland, Amsterdam,1978,Vol. II.</title>
</host>
</json:item>
<json:item><host><author></author>
<title>Finding the Global Extremum of a Poynomial Function</title>
</host>
</json:item>
<json:item><author><json:item><name>B. C. Eaves</name>
</json:item>
<json:item><name>W. I. Zangwill</name>
</json:item>
</author>
<host><volume>9</volume>
<pages><last>542</last>
<first>529</first>
</pages>
<author></author>
<title>SIAM Journal of Control</title>
</host>
<title>Generalized Cutting Plane Algorithms</title>
</json:item>
<json:item><host><author></author>
<title>Contribution à l'Analyse et l'Optimisation de Differences de Fonctions Convexes</title>
</host>
</json:item>
<json:item><author><json:item><name>S. S. Erenguc</name>
</json:item>
</author>
<host><volume>35</volume>
<pages><last>22</last>
<first>1</first>
</pages>
<author></author>
<title>Naval Research Logistics</title>
</host>
<title>Multiproduct Dynamic Lot‐Sizing Model with Coordinated Replenishment</title>
</json:item>
<json:item><host><author></author>
<title>Concave Integer Minimizations Over a Compact, Convex Set</title>
</host>
</json:item>
<json:item><author><json:item><name>S. S. Erenguc</name>
</json:item>
<json:item><name>H. P. Benson</name>
</json:item>
</author>
<host><volume>33</volume>
<pages><last>177</last>
<first>157</first>
</pages>
<author></author>
<title>Naval Research Logistics Quarterly</title>
</host>
<title>The Interactive Fixed Charge Linear Programming Problem</title>
</json:item>
<json:item><host><author></author>
<title>Evtushenko, G. Y.,“Numerical Optimization Techniques,” Translation Series in Mathematics and Engineering,”Optimization Software Inc., Publication Division, New York,1985.</title>
</host>
</json:item>
<json:item><author><json:item><name>J. E. Falk</name>
</json:item>
</author>
<host><volume>7</volume>
<pages><last>545</last>
<first>534</first>
</pages>
<author></author>
<title>SIAM Journal of Control</title>
</host>
<title>Langrange Multipliers and Nonconvex Programs</title>
</json:item>
<json:item><host><author></author>
<title>An Algorithm for Locating Approximate Global Solutions of Nonconvex, Separable Problems</title>
</host>
</json:item>
<json:item><author><json:item><name>J. E. Falk</name>
</json:item>
</author>
<host><volume>21</volume>
<pages><last>340</last>
<first>337</first>
</pages>
<author></author>
<title>Operations Research</title>
</host>
<title>Conditions for Global Optimality in Nonlinear Programming</title>
</json:item>
<json:item><author><json:item><name>J. E. Falk</name>
</json:item>
</author>
<host><volume>5</volume>
<pages><last>188</last>
<first>169</first>
</pages>
<author></author>
<title>Mathematical Programming</title>
</host>
<title>A Linear Max‐Min Problem</title>
</json:item>
<json:item><author><json:item><name>J. E. Falk</name>
</json:item>
<json:item><name>K. L. Hoffman</name>
</json:item>
</author>
<host><volume>1</volume>
<pages><last>259</last>
<first>251</first>
</pages>
<author></author>
<title>Mathematics of Operations Research</title>
</host>
<title>A Successive Underestimating Method for Concave Minimization Problems</title>
</json:item>
<json:item><author><json:item><name>J. E. Falk</name>
</json:item>
<json:item><name>K. L. Hoffman</name>
</json:item>
</author>
<host><volume>34</volume>
<pages><last>929</last>
<first>919</first>
</pages>
<author></author>
<title>Operations Research</title>
</host>
<title>Concave Minimization via Collapsing Polytopes</title>
</json:item>
<json:item><author><json:item><name>J. E. Falk</name>
</json:item>
<json:item><name>R. M. Soland</name>
</json:item>
</author>
<host><volume>15</volume>
<pages><last>569</last>
<first>550</first>
</pages>
<author></author>
<title>Management Science</title>
</host>
<title>An Algorithm for Separable Nonconvex Programming Problems</title>
</json:item>
<json:item><host><author></author>
<title>Fedorov, V. V., Ed.,“Problems of Cybernetics, Models and Methods in Global Optimization,”USSR Academy of Science, Moscow(1985) (in Russian).</title>
</host>
</json:item>
<json:item><author><json:item><name>M. Florian</name>
</json:item>
</author>
<host><volume>26</volume>
<pages><last>196</last>
<first>167</first>
</pages>
<author></author>
<title>Mathematical Programming Study</title>
</host>
<title>Nonlinear Cost Network Models in Transportation Analysis</title>
</json:item>
<json:item><author><json:item><name>M. Fukushima</name>
</json:item>
</author>
<host><volume>31</volume>
<pages><last>113</last>
<first>101</first>
</pages>
<author></author>
<title>Operations Research</title>
</host>
<title>An Outer Approximation Algorithm for Solving General Convex Programs</title>
</json:item>
<json:item><author><json:item><name>M. Fukushima</name>
</json:item>
</author>
<host><volume>10</volume>
<pages><last>156</last>
<first>147</first>
</pages>
<author></author>
<title>Journal of Computational and Applied Mathematics</title>
</host>
<title>On the Convergence of a Class of Outer Approximation Algorithms for Convex Programs</title>
</json:item>
<json:item><host><author></author>
<title>A Finite Cutting Plane Method for Solving Linear Programs with an Additional Reverse Convex Constraint</title>
</host>
</json:item>
<json:item><author><json:item><name>E. A. Galperin</name>
</json:item>
</author>
<host><volume>112</volume>
<pages><last>640</last>
<first>635</first>
</pages>
<author></author>
<title>Journal of Mathematical Analysis and Applications</title>
</host>
<title>The Cubic Algorithm</title>
</json:item>
<json:item><author><json:item><name>E. A. Galperin</name>
</json:item>
<json:item><name>Q. Zheng</name>
</json:item>
</author>
<host><volume>54</volume>
<pages><last>92</last>
<first>63</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Applications</title>
</host>
<title>Nonlinear Observation via Global Optimization Methods: Measure Theory Approach</title>
</json:item>
<json:item><host><author></author>
<title>Garcia, C. B. andZangwill, W. I.,Pathways to Solutions, Fixed Points and Equilibra,Prentice‐Hall, Englewood Cliffs, NJ,(1981.</title>
</host>
</json:item>
<json:item><author><json:item><name>I. I. Gasanov</name>
</json:item>
<json:item><name>A. D. Rikun</name>
</json:item>
</author>
<host><volume>30</volume>
<pages><last>459</last>
<first>457</first>
</pages>
<author></author>
<title>Soviet Mathematics Doklady</title>
</host>
<title>On Necessary and Sufficient Conditions for Uniextremality in Nonconvex Mathematical Programming Problems</title>
</json:item>
<json:item><author><json:item><name>I. I. Gasanov</name>
</json:item>
<json:item><name>A. D. Rikun</name>
</json:item>
</author>
<host><volume>25</volume>
<pages><last>113</last>
<first>105</first>
</pages>
<author></author>
<title>USSR Computational Mathematics and Mathematical Physics</title>
</host>
<title>The Necessary and Sufficient Conditions for Single Extremality in Nonconvex Problems of Mathematical Programming</title>
</json:item>
<json:item><author><json:item><name>F. Giannessi</name>
</json:item>
<json:item><name>L. Jurina</name>
</json:item>
<json:item><name>G. Maier</name>
</json:item>
</author>
<host><volume>1</volume>
<pages><last>91</last>
<first>81</first>
</pages>
<author></author>
<title>Engineering Structures</title>
</host>
<title>Optimal Excavation Profile for a Pipeline Freely Resting on the Sea Floor</title>
</json:item>
<json:item><author><json:item><name>F. Giannessi</name>
</json:item>
<json:item><name>F. Niccolucci</name>
</json:item>
</author>
<host><volume>19</volume>
<pages><last>176</last>
<first>161</first>
</pages>
<author></author>
<title>Istituto Nazionale di Alta Mathematica, Symposia Mathematica</title>
</host>
<title>Connections between Nonlinear and Integer Programming Problems</title>
</json:item>
<json:item><author><json:item><name>F. Glover</name>
</json:item>
</author>
<host><volume>21</volume>
<pages><last>124</last>
<first>123</first>
</pages>
<author></author>
<title>Operations Research</title>
</host>
<title>Convexity Cuts and Cut Search</title>
</json:item>
<json:item><author><json:item><name>F. Glover</name>
</json:item>
<json:item><name>E. Woolsey</name>
</json:item>
</author>
<host><volume>21</volume>
<pages><last>161</last>
<first>141</first>
</pages>
<author></author>
<title>Operations Research</title>
</host>
<title>Further Reduction of Zero‐One Polynomial Programming Problems to Zero‐One Linear Programming Problems</title>
</json:item>
<json:item><author><json:item><name>F. Glover</name>
</json:item>
<json:item><name>E. Woolsey</name>
</json:item>
</author>
<host><volume>22</volume>
<pages><last>182</last>
<first>180</first>
</pages>
<author></author>
<title>Operations Research</title>
</host>
<title>Converting the 0–1 Polynomial Programming Problem to a Linear 0–1 Program</title>
</json:item>
<json:item><author><json:item><name>P. Hansen</name>
</json:item>
</author>
<host><volume>5</volume>
<pages><last>70</last>
<first>53</first>
</pages>
<author></author>
<title>Annals of Discrete Mathematics, Discrete Optimization II</title>
</host>
<title>Methods of Nonlinear 0–1 Programming</title>
</json:item>
<json:item><author><json:item><name>P. Hartman</name>
</json:item>
</author>
<host><volume>9</volume>
<pages><last>713</last>
<first>707</first>
</pages>
<author></author>
<title>Pacific Journal of Mathematics</title>
</host>
<title>On Functions Representable as a Difference of Convex Functions</title>
</json:item>
<json:item><author><json:item><name>B. Heron</name>
</json:item>
<json:item><name>M. Sermange</name>
</json:item>
</author>
<host><volume>8</volume>
<pages><last>382</last>
<first>351</first>
</pages>
<author></author>
<title>Applied Mathematics and Optimization</title>
</host>
<title>Nonconvex Methods for Computing Free Boundary Equilibria of Axially Symmetric Plasmas</title>
</json:item>
<json:item><author><json:item><name>R. J. Hillestad</name>
</json:item>
</author>
<host><volume>23</volume>
<pages><last>1098</last>
<first>1091</first>
</pages>
<author></author>
<title>Operations Research</title>
</host>
<title>Optimization Problems Subject to a Budget Constraint with Economies of Scale</title>
</json:item>
<json:item><author><json:item><name>R. J. Hillestad</name>
</json:item>
<json:item><name>S. E. Jacobsen</name>
</json:item>
</author>
<host><volume>6</volume>
<pages><last>78</last>
<first>63</first>
</pages>
<author></author>
<title>Applied Mathematics and Optimization</title>
</host>
<title>Reverse Convex Programming</title>
</json:item>
<json:item><author><json:item><name>R. J. Hillestad</name>
</json:item>
<json:item><name>S. E. Jacobsen</name>
</json:item>
</author>
<host><volume>6</volume>
<pages><last>269</last>
<first>257</first>
</pages>
<author></author>
<title>Applied Mathematics and Optimization</title>
</host>
<title>Linear Programs with an Additional Reverse Convex Constraint</title>
</json:item>
<json:item><author><json:item><name>J. B. Hiriart‐Urruty</name>
</json:item>
</author>
<host><volume>256</volume>
<pages><last>69</last>
<first>37</first>
</pages>
<author></author>
<title>Lecture Notes in Economics and Mathematical Systems</title>
</host>
<title>Generalized Differentiability, Duality and Optimization for Problems Dealing with Differences of Convex Functions</title>
</json:item>
<json:item><author><json:item><name>K. L. Hoffman</name>
</json:item>
</author>
<host><volume>20</volume>
<pages><last>32</last>
<first>22</first>
</pages>
<author></author>
<title>Mathematical Programming</title>
</host>
<title>A Method for Globally Minimizing Concave Functions over Convex Sets</title>
</json:item>
<json:item><author><json:item><name>W. W. Hogan</name>
</json:item>
</author>
<host><volume>5</volume>
<pages><last>168</last>
<first>161</first>
</pages>
<author></author>
<title>Mathematical Programming</title>
</host>
<title>Applications of a General Convergence Theory for Outer Approximation Algorithms</title>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
</author>
<host><volume>3</volume>
<pages><last>348</last>
<first>347</first>
</pages>
<author></author>
<title>Zeitschrift für Angewandte Mathematik and Mechanik</title>
</host>
<title>On the Characterization of Affine Hull‐Functionals</title>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
</author>
<host><volume>41</volume>
<pages><last>337</last>
<first>330</first>
</pages>
<author></author>
<title>Lecture Notes in Computer Science</title>
</host>
<title>A New Branch and Bound Approach for Concave Minimization Problems</title>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
</author>
<host><volume>10</volume>
<pages><last>321</last>
<first>312</first>
</pages>
<author></author>
<title>Mathematical Programming</title>
</host>
<title>An Algorithm for Nonconvex Programming Problems</title>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
</author>
<host><volume>7</volume>
<pages><last>47</last>
<first>39</first>
</pages>
<author></author>
<title>Proceedings in Operations Research</title>
</host>
<title>A New Approach for Separable Nonconvex Minimization Problems Including a Method for Finding the Global Minimum of a Function of a Single Variable</title>
</json:item>
<json:item><host><author></author>
<title>Horst, R.,“Nichtlineare Optimierung,”Carl Hanser Verlag, München(1979).</title>
</host>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
</author>
<host><volume>19</volume>
<pages><last>238</last>
<first>237</first>
</pages>
<author></author>
<title>Mathematical Programming</title>
</host>
<title>A Note on the Convergence of an Algorithm for Nonconvex Programming Problems</title>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
</author>
<host><volume>33</volume>
<pages><last>463</last>
<first>457</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Applications</title>
</host>
<title>A Note on Function Whose Local Minima are Global</title>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
</author>
<host><volume>15</volume>
<pages><last>392</last>
<first>382</first>
</pages>
<author></author>
<title>European Journal of Operational Research</title>
</host>
<title>On the Convexification of Nonconvex Programming Problems</title>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
</author>
<host><volume>104</volume>
<pages><last>183</last>
<first>481</first>
</pages>
<author></author>
<title>Journal of Mathematical Analysis and Applications</title>
</host>
<title>Global Minimization in Arcwise Connected Spaces</title>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
</author>
<host><volume>6</volume>
<pages><last>205</last>
<first>195</first>
</pages>
<author></author>
<title>Operations Research Spektrum</title>
</host>
<title>On the Global Minimization of Concave Functions</title>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
</author>
<host><volume>51</volume>
<pages><last>291</last>
<first>271</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Applications</title>
</host>
<title>A General Class of Branch‐and‐Bound Methods in Global Optimization with some New Approaches for Concave Minimization</title>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
</author>
<host><volume>58</volume>
<pages><last>37</last>
<first>11</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Applications</title>
</host>
<title>Deterministic Global Optimization with Partition Sets Whose Feasibility is Not Known. Application to Concave Minimization, DC‐Programming, Reverse Convex Constraints and Lipschitzian Optimization</title>
</json:item>
<json:item><host><pages><last>88</last>
<first>73</first>
</pages>
<author></author>
<title>Horst, R.,“On Solving Lipschitzian Optimization Problems”,in P. D. Dieu et al., Eds.,Essays on Nonlinear Analysis and Optimization Problems,National Center for Scientific Research, Hanoi,pp. 73–88.</title>
</host>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
</author>
<host><volume>61</volume>
<pages><last>146</last>
<first>143</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Applications</title>
</host>
<title>On Consistency of Bounding Operations in Deterministic Global Optimization</title>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
<json:item><name>P. T. Thach</name>
</json:item>
</author>
<host><volume>134</volume>
<pages><last>430</last>
<first>426</first>
</pages>
<author></author>
<title>Journal of Mathematical Analysis and Applications</title>
</host>
<title>A Topological Property of Limes‐Arcwise Strictly Quasiconvex Functions</title>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
<json:item><name>N. V. Thoai</name>
</json:item>
</author>
<host><volume>58</volume>
<pages><last>146</last>
<first>139</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Application</title>
</host>
<title>Branch and Bound Methods for Solving Systems of Nonlinear Equations and Inequalities</title>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
<json:item><name>N. V. Thoai</name>
</json:item>
</author>
<host><volume>42</volume>
<pages><last>289</last>
<first>271</first>
</pages>
<author></author>
<title>Computing</title>
</host>
<title>Modification, Implementation and Comparison of Three Algorithms for Globally Solving Linearly Constrained Concave Minimization Problems</title>
</json:item>
<json:item><host><author></author>
<title>Conical Algorithms for the Global Minimization of Linearly Constrained Large‐Scale Concave Minimization Problems</title>
</host>
</json:item>
<json:item><host><author></author>
<title>Mathematical Programming</title>
</host>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
<json:item><name>N. V. Thoai</name>
</json:item>
<json:item><name>J. de Vries</name>
</json:item>
</author>
<host><volume>7</volume>
<pages><last>90</last>
<first>85</first>
</pages>
<author></author>
<title>Operations Research Letters</title>
</host>
<title>On Finding the New Vertices and Rundandant Constraints in Cutting Plane Algorithms for Global Optimization</title>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
<json:item><name>N. V. Thoai</name>
</json:item>
<json:item><name>H. Tuy</name>
</json:item>
</author>
<host><volume>9</volume>
<pages><last>159</last>
<first>153</first>
</pages>
<author></author>
<title>Operations Research Spektrum</title>
</host>
<title>Outer Approximation by Polyhedral Convex Sets</title>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
<json:item><name>N. V. Thoai</name>
</json:item>
<json:item><name>H. Tuy</name>
</json:item>
</author>
<host><volume>20</volume>
<pages><last>264</last>
<first>255</first>
</pages>
<author></author>
<title>Optimization</title>
</host>
<title>On an Outer Approximation Concept in Global Optimization</title>
</json:item>
<json:item><author><json:item><name>R. Horst</name>
</json:item>
<json:item><name>H. Tuy</name>
</json:item>
</author>
<host><volume>54</volume>
<pages><last>271</last>
<first>253</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Applications</title>
</host>
<title>On the Convergence of Global Methods in Multiextremal Problems</title>
</json:item>
<json:item><author><json:item><name>S. E. Jacobsen</name>
</json:item>
</author>
<host><volume>7</volume>
<pages><last>9</last>
<first>1</first>
</pages>
<author></author>
<title>Applied Mathematics and Optimization</title>
</host>
<title>Convergence of a Tuy‐Type‐Algorithm for Concave Minimization Subject to Linear Inequality Constraints</title>
</json:item>
<json:item><author><json:item><name>B. Kalantari</name>
</json:item>
</author>
<host><volume>5</volume>
<pages><last>49</last>
<first>47</first>
</pages>
<author></author>
<title>Operation Research Letters</title>
</host>
<title>Quadratic Functions with Exponential Number of Local Maxima</title>
</json:item>
<json:item><author><json:item><name>B. Kalantari</name>
</json:item>
<json:item><name>J. B. Rosen</name>
</json:item>
</author>
<host><volume>48</volume>
<pages><last>313</last>
<first>303</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Application</title>
</host>
<title>Construction of Large Scale Global Minimum Concave Quadratic Test Problems</title>
</json:item>
<json:item><author><json:item><name>B. Kalantari</name>
</json:item>
<json:item><name>J. B. Rosen</name>
</json:item>
</author>
<host><volume>12</volume>
<pages><last>561</last>
<first>544</first>
</pages>
<author></author>
<title>Mathematics of Operations Research</title>
</host>
<title>Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions</title>
</json:item>
<json:item><author><json:item><name>J. E. Kelley</name>
</json:item>
</author>
<host><volume>8</volume>
<pages><last>712</last>
<first>703</first>
</pages>
<author></author>
<title>Journal SIAM</title>
</host>
<title>The Cutting‐Plane Method for Solving Convex Programs</title>
</json:item>
<json:item><author><json:item><name>K. C. Kiwiel</name>
</json:item>
</author>
<host><author></author>
<title>Lecture Notes in Mathematics 1133</title>
</host>
<title>Methods of Descent for Nondifferentiable Optimization</title>
</json:item>
<json:item><author><json:item><name>H. Konno</name>
</json:item>
</author>
<host><volume>11</volume>
<pages><last>27</last>
<first>14</first>
</pages>
<author></author>
<title>Mathematical Programming</title>
</host>
<title>A Cutting‐Plane Algorithm for Solving Bilinear Programs</title>
</json:item>
<json:item><author><json:item><name>E. S. Levitin</name>
</json:item>
<json:item><name>B. T. Polyak</name>
</json:item>
</author>
<host><volume>6</volume>
<pages><last>50</last>
<first>1</first>
</pages>
<author></author>
<title>USSR Computational Mathematics and Mathematical Physics</title>
</host>
<title>Constrained Minimization Methods</title>
</json:item>
<json:item><author><json:item><name>A. Majthay</name>
</json:item>
<json:item><name>A. Whinston</name>
</json:item>
</author>
<host><volume>9</volume>
<pages><last>59</last>
<first>35</first>
</pages>
<author></author>
<title>Discrete Mathematics</title>
</host>
<title>Quaisiconcave Minimization Subject to Linear Constraints</title>
</json:item>
<json:item><host><author></author>
<title>Mangasarian, O. L.,Nonlinear Programming,McGraw‐Hill, New York,1969.</title>
</host>
</json:item>
<json:item><author><json:item><name>O. L. Mangasarian</name>
</json:item>
</author>
<host><volume>7</volume>
<pages><last>78</last>
<first>74</first>
</pages>
<author></author>
<title>Mathematical Programming Study</title>
</host>
<title>Characterization of Linear Complementarity Problems as Linear Programs</title>
</json:item>
<json:item><author><json:item><name>B. Martos</name>
</json:item>
</author>
<host><volume>2</volume>
<pages><last>273</last>
<first>265</first>
</pages>
<author></author>
<title>Studia Scientiarum Mathematicarum Hungaria</title>
</host>
<title>Quasiconvexity and Quasimonotonicity in Nonlinear Programming</title>
</json:item>
<json:item><host><author></author>
<title>Martos, B.,Nonlinear Programming,North Holland, Amsterdam,1975.</title>
</host>
</json:item>
<json:item><author><json:item><name>T. H. Matheis</name>
</json:item>
<json:item><name>D. S. Rubin</name>
</json:item>
</author>
<host><volume>5</volume>
<pages><last>184</last>
<first>167</first>
</pages>
<author></author>
<title>Mathematics of Operations Research</title>
</host>
<title>A Survey and Comparison of Methods for Finding all Vertices of Convex Polyhedral Sets</title>
</json:item>
<json:item><author><json:item><name>D. Q. Mayne</name>
</json:item>
<json:item><name>E. Polak</name>
</json:item>
</author>
<host><volume>47</volume>
<pages><last>30</last>
<first>19</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Applications</title>
</host>
<title>Outer Approximation Algorithm for Nondifferentiable Optimization Problems</title>
</json:item>
<json:item><author><json:item><name>G. P. McCormick</name>
</json:item>
</author>
<host><volume>10</volume>
<pages><last>175</last>
<first>147</first>
</pages>
<author></author>
<title>Mathematical Programming</title>
</host>
<title>Computability of Global Solutions to Factorable Nonconvex Programs: Part I‐Convex Underestimating Problems</title>
</json:item>
<json:item><host><author></author>
<title>McCormick, G. P.,Nonlinear Programming: Theory, Algorithms and Applications,John Wiley and Sons, New York,1983.</title>
</host>
</json:item>
<json:item><author><json:item><name>R. R. Meyer</name>
</json:item>
</author>
<host><volume>8</volume>
<pages><last>54</last>
<first>41</first>
</pages>
<author></author>
<title>SIAM Journal of Control</title>
</host>
<title>The Validity of a Family of Optimization Methods</title>
</json:item>
<json:item><author><json:item><name>R. R. Meyer</name>
</json:item>
</author>
<host><volume>26</volume>
<pages><last>39</last>
<first>21</first>
</pages>
<author></author>
<title>Mathematical Programming</title>
</host>
<title>Computational Aspects of Two‐Segment Separable Programming</title>
</json:item>
<json:item><author><json:item><name>R. H. Mladineo</name>
</json:item>
</author>
<host><volume>34</volume>
<pages><last>200</last>
<first>188</first>
</pages>
<author></author>
<title>Mathematical Programming</title>
</host>
<title>An Algorithm for Finding the Global Maximum of a Multi‐modal, Multivariate Function</title>
</json:item>
<json:item><author><json:item><name>B. M. Mukhamediev</name>
</json:item>
</author>
<host><volume>22</volume>
<pages><last>245</last>
<first>238</first>
</pages>
<author></author>
<title>USSR Computational Mathematics and Mathematical Physics</title>
</host>
<title>Approximate Methods for Solving Concave Programming Problems</title>
</json:item>
<json:item><host><author></author>
<title>Nguyen, V. H.,Strodiot, J. J., andThoai, N. V.,“On an Optimum Shape Design Problem,”Technical Report 85/5,Department of Mathematics, University of Namur, Belgium,1985.</title>
</host>
</json:item>
<json:item><author><json:item><name>P. M. Pardalos</name>
</json:item>
</author>
<host><volume>13</volume>
<pages><last>137</last>
<first>133</first>
</pages>
<author></author>
<title>ACM Transactions on Mathematical Software</title>
</host>
<title>Generation of Large‐Scale Quadratic Programs for Use in Global Optimization Test Problems</title>
</json:item>
<json:item><host><author></author>
<title>Global Optimization Algorithm for Linearly Constrained Indefinite Quadratic Problems</title>
</host>
</json:item>
<json:item><author><json:item><name>P. M. Pardalos</name>
</json:item>
<json:item><name>J. H. Glick</name>
</json:item>
<json:item><name>J. B. Rosen</name>
</json:item>
</author>
<host><volume>39</volume>
<pages><last>291</last>
<first>281</first>
</pages>
<author></author>
<title>Computing</title>
</host>
<title>Global Minimization of Indefinite Quadratic Problems</title>
</json:item>
<json:item><author><json:item><name>P. M. Pardalos</name>
</json:item>
<json:item><name>J. B. Rosen</name>
</json:item>
</author>
<host><volume>28</volume>
<pages><last>379</last>
<first>367</first>
</pages>
<author></author>
<title>SIAM Review</title>
</host>
<title>Methods for Global Concave Minimization: A Bibliographic Survey</title>
</json:item>
<json:item><host><volume>22</volume>
<author></author>
<title>Pardalos, P. M. andRosen, J. B.,“Constrained Global Optimization: Algorithms and Applications,”Lecture Notes in Computer Science,268,Springer,1987.</title>
</host>
</json:item>
<json:item><author><json:item><name>P. M. Pardalos</name>
</json:item>
<json:item><name>J. B. Rosen</name>
</json:item>
</author>
<host><volume>9</volume>
<pages><last>353</last>
<first>341</first>
</pages>
<author></author>
<title>SIAM Journal Scientific and Statistical Computing</title>
</host>
<title>Global Optimization Approach to the Linear Complementarity Problem</title>
</json:item>
<json:item><host><author></author>
<title>A Parallel Algorithm for Constrained Concave Quadratic Global Minimization: Computational Aspects</title>
</host>
</json:item>
<json:item><author><json:item><name>S. A. Pijavskii</name>
</json:item>
</author>
<host><volume>12</volume>
<pages><last>67</last>
<first>57</first>
</pages>
<author></author>
<title>USSR Computational Mathematics and Mathematical Physics</title>
</host>
<title>An Algorithm for Finding the Absolute Extremum of a Function</title>
</json:item>
<json:item><author><json:item><name>J. Pinter</name>
</json:item>
</author>
<host><volume>36</volume>
<pages><last>103</last>
<first>91</first>
</pages>
<author></author>
<title>Computing</title>
</host>
<title>Extended Univariate Algorithms for n‐dimensional Global Optimization</title>
</json:item>
<json:item><author><json:item><name>J. Pinter</name>
</json:item>
</author>
<host><volume>17</volume>
<pages><last>202</last>
<first>187</first>
</pages>
<author></author>
<title>Optimization</title>
</host>
<title>Globally Convergent Methods for n‐dimensional Multiextremal Optimization</title>
</json:item>
<json:item><host><author></author>
<title>Branch‐and‐Bound Algorithm for Solving Multiextremal Mathematical Programming Problems with Lipschitzian Structure</title>
</host>
</json:item>
<json:item><author><json:item><name>J. Pinter</name>
</json:item>
<json:item><name>J. Szabo</name>
</json:item>
<json:item><name>L. Somlyody</name>
</json:item>
</author>
<host><volume>1</volume>
<pages><last>105</last>
<first>98</first>
</pages>
<author></author>
<title>Environmental Software</title>
</host>
<title>Multiextremal Optimization for Calibrating Water Resources Models</title>
</json:item>
<json:item><author><json:item><name>M. Raghavachari</name>
</json:item>
</author>
<host><volume>17</volume>
<pages><last>684</last>
<first>680</first>
</pages>
<author></author>
<title>Operations Research</title>
</host>
<title>On Connections Between Zero‐One Integer Programming and Concave Programming Under Linear Constraints</title>
</json:item>
<json:item><host><author></author>
<title>Ratschek, H. andRockne, J.,“New Computer Methods for Global Optimization,”Ellis Horwood, Chichester,1988.</title>
</host>
</json:item>
<json:item><host><author></author>
<title>Rockafellar, R. T.,Convex Analysis,Princeton University Press, Princeton, NJ,1970.</title>
</host>
</json:item>
<json:item><author><json:item><name>J. B. Rosen</name>
</json:item>
</author>
<host><volume>8</volume>
<pages><last>230</last>
<first>215</first>
</pages>
<author></author>
<title>Mathematics of Operations Research</title>
</host>
<title>Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain</title>
</json:item>
<json:item><author><json:item><name>J. B. Rosen</name>
</json:item>
</author>
<host><volume>22</volume>
<pages><last>236</last>
<first>231</first>
</pages>
<author></author>
<title>Mathematical Programming Study</title>
</host>
<title>Performance of Approximate Algorithms for Global Optimization</title>
</json:item>
<json:item><author><json:item><name>J. B. Rosen</name>
</json:item>
<json:item><name>P. M. Pardalos</name>
</json:item>
</author>
<host><volume>34</volume>
<pages><last>174</last>
<first>163</first>
</pages>
<author></author>
<title>Mathematical Programming</title>
</host>
<title>Global Minimization of Large‐Scale Constrained Quadratic Problems by Separable Programming</title>
</json:item>
<json:item><author><json:item><name>S. Sen</name>
</json:item>
<json:item><name>H. D. Sherali</name>
</json:item>
</author>
<host><volume>37</volume>
<pages><last>183</last>
<first>169</first>
</pages>
<author></author>
<title>Mathematical Programming</title>
</host>
<title>Nondifferentiable Reverse Convex Programs and Facial Convexity Cuts via Disjunctive Characterization</title>
</json:item>
<json:item><author><json:item><name>H. D. Sherali</name>
</json:item>
<json:item><name>C. M. Shetty</name>
</json:item>
</author>
<host><volume>27</volume>
<pages><last>476</last>
<first>453</first>
</pages>
<author></author>
<title>Naval Research Logistics Quarterly</title>
</host>
<title>Deep Cuts in Disjunctive Programming</title>
</json:item>
<json:item><host><author></author>
<title>Sherali, H. D. andShetty, C. M.,“Optimization with Disjunctive Constraints,”Springer‐Verlag, Berlin,1980.</title>
</host>
</json:item>
<json:item><author><json:item><name>B. O. Shubert</name>
</json:item>
</author>
<host><volume>9</volume>
<pages><last>388</last>
<first>379</first>
</pages>
<author></author>
<title>SIAM Journal of Numerical Analysis</title>
</host>
<title>A Sequential Method Seeking the Global Maximum of a Function</title>
</json:item>
<json:item><author><json:item><name>I. Singer</name>
</json:item>
</author>
<host><volume>11</volume>
<pages><last>234</last>
<first>221</first>
</pages>
<author></author>
<title>Mathematiche Operationsforschung und Statistik, Serie Optimization</title>
</host>
<title>Minimization of Continuous Convex Functionals on Complements of Convex Subsets of Locally Convex Spaces</title>
</json:item>
<json:item><author><json:item><name>R. M. Soland</name>
</json:item>
</author>
<host><volume>11</volume>
<pages><last>773</last>
<first>759</first>
</pages>
<author></author>
<title>Management Science</title>
</host>
<title>An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints</title>
</json:item>
<json:item><host><author></author>
<title>Strongin, R. G.,“Numerical Methods for Multiextremal Problems,”Nauka, Moscow,1978 (in Russian).</title>
</host>
</json:item>
<json:item><author><json:item><name>Y. Y. Sung</name>
</json:item>
<json:item><name>J. B. Rosen</name>
</json:item>
</author>
<host><volume>24</volume>
<pages><last>355</last>
<first>353</first>
</pages>
<author></author>
<title>Mathematical Programming</title>
</host>
<title>Global Minimum Test Problems Construction</title>
</json:item>
<json:item><author><json:item><name>H. Taha</name>
</json:item>
</author>
<host><volume>20</volume>
<pages><last>548</last>
<first>533</first>
</pages>
<author></author>
<title>Naval Research Logistics Quarterly</title>
</host>
<title>Concave Minimization Over a Convex Polyhedron</title>
</json:item>
<json:item><author><json:item><name>P. T. Thach</name>
</json:item>
</author>
<host><volume>10</volume>
<pages><last>57</last>
<first>35</first>
</pages>
<author></author>
<title>Acta Mathematica Vietnamica</title>
</host>
<title>Convex Programs with Several Additional Reverse Convex Constraints</title>
</json:item>
<json:item><author><json:item><name>P. T. Thach</name>
</json:item>
</author>
<host><volume>41</volume>
<pages><last>248</last>
<first>229</first>
</pages>
<author></author>
<title>Mathematical Programming</title>
</host>
<title>The Design Centering Problem as a DC‐Programming Problem</title>
</json:item>
<json:item><host><author></author>
<title>Convex Minimization under Lipschitz Constraints</title>
</host>
</json:item>
<json:item><host><author></author>
<title>Design Centering Problems with Lipschitzian Structure</title>
</host>
</json:item>
<json:item><author><json:item><name>P. T. Thach</name>
</json:item>
<json:item><name>H. Tuy</name>
</json:item>
</author>
<host><volume>4</volume>
<pages><last>217</last>
<first>205</first>
</pages>
<author></author>
<title>Japan Journal of Applied Mathematics</title>
</host>
<title>Global Optimization under Lipschitzian Constraints</title>
</json:item>
<json:item><author><json:item><name>T. V. Thieu</name>
</json:item>
</author>
<host><volume>2</volume>
<pages><last>113</last>
<first>106</first>
</pages>
<author></author>
<title>Acta Mathematica Vietnamica</title>
</host>
<title>Relationship between Bilinear Programming and Concave Programming</title>
</json:item>
<json:item><host><author></author>
<title>An Outer Approximation Method for Globally Minimizing a Concave Function Over a Compact Convex Set</title>
</host>
</json:item>
<json:item><author><json:item><name>N. V. Thoai</name>
</json:item>
</author>
<host><volume>11</volume>
<pages><last>51</last>
<first>45</first>
</pages>
<author></author>
<title>Mathematische Operationsforschung und Statistik, Serie Optimization</title>
</host>
<title>Anwendung des Erweiterungsprinzips zur Lösung Konkaver Optimierungsaufgaben</title>
</json:item>
<json:item><author><json:item><name>N. V. Thoai</name>
</json:item>
</author>
<host><volume>19</volume>
<pages><last>674</last>
<first>665</first>
</pages>
<author></author>
<title>Optimization</title>
</host>
<title>A Modified Version of Tuy's Method for Solving DC Programming Problems</title>
</json:item>
<json:item><author><json:item><name>N. V. Thoai</name>
</json:item>
<json:item><name>H. Tuy</name>
</json:item>
</author>
<host><volume>5</volume>
<pages><last>566</last>
<first>556</first>
</pages>
<author></author>
<title>Mathematics of Operations Research</title>
</host>
<title>Convergent Algorithms for Minimizing a Concave Function</title>
</json:item>
<json:item><host><volume>22</volume>
<pages><last>302</last>
<first>291</first>
</pages>
<author></author>
<title>Thuong, T. V. andTuy, H.,“A Finite Algorithm for Solving Linear Programs with an Additional Reverse Convex Constraint,”Lecture Notes in Economics and Mathematical Systems,225,Springer,291–302(1984).</title>
</host>
</json:item>
<json:item><author><json:item><name>J. F. Toland</name>
</json:item>
</author>
<host><volume>66</volume>
<pages><last>415</last>
<first>399</first>
</pages>
<author></author>
<title>Journal of Mathematical Analysis and Applications</title>
</host>
<title>Duality in Nonconvex Optimization</title>
</json:item>
<json:item><author><json:item><name>J. F. Toland</name>
</json:item>
</author>
<host><volume>71</volume>
<pages><last>61</last>
<first>41</first>
</pages>
<author></author>
<title>Archive of Rational Mechanics and Analysis</title>
</host>
<title>A Duality Principle for Nonconvex Optimization and the Calculus of Variations</title>
</json:item>
<json:item><author><json:item><name>H. Tuy</name>
</json:item>
</author>
<host><volume>5</volume>
<pages><last>1440</last>
<first>1437</first>
</pages>
<author></author>
<title>Soviet Mathematics</title>
</host>
<title>Concave Programming under Linear Constraints</title>
</json:item>
<json:item><author><json:item><name>H. Tuy</name>
</json:item>
</author>
<host><volume>8</volume>
<pages><last>34</last>
<first>3</first>
</pages>
<author></author>
<title>Acta Mathematica Vietnamica</title>
</host>
<title>On Outer Approximation Methods for Solving Concave Minimization Problems</title>
</json:item>
<json:item><author><json:item><name>H. Tuy</name>
</json:item>
</author>
<host><pages><last>118</last>
<first>226</first>
</pages>
<author></author>
<title>Selected Topics in Operations Research and Mathematical Economics, Lecture Notes in Economics and Mathematical Systems</title>
</host>
<title>Global Minimization of a Difference of Two Convex Functions</title>
</json:item>
<json:item><author><json:item><name>H. Tuy</name>
</json:item>
</author>
<host><pages><last>162</last>
<first>137</first>
</pages>
<author></author>
<title>Fermat Days 1985: Mathematics for Optimization</title>
</host>
<title>A General Deterministic Approach to Global Optimization via DC Programming</title>
</json:item>
<json:item><author><json:item><name>H. Tuy</name>
</json:item>
</author>
<host><volume>30</volume>
<pages><last>182</last>
<first>150</first>
</pages>
<author></author>
<title>Mathematical Programming Study</title>
</host>
<title>Global Minimization of a Difference of Two Convex Functions</title>
</json:item>
<json:item><author><json:item><name>H. Tuy</name>
</json:item>
</author>
<host><volume>52</volume>
<pages><last>485</last>
<first>463</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Applications</title>
</host>
<title>Convex Programs with an Additional Reverse Convex Constraint</title>
</json:item>
<json:item><host><author></author>
<title>Optimization</title>
</host>
</json:item>
<json:item><host><author></author>
<title>Normal Conical Algorithm for Concave Minimization Over Polytopes</title>
</host>
</json:item>
<json:item><author><json:item><name>H. Tuy</name>
</json:item>
<json:item><name>R. Horst</name>
</json:item>
</author>
<host><volume>41</volume>
<pages><last>183</last>
<first>161</first>
</pages>
<author></author>
<title>Mathematical Programming</title>
</host>
<title>Convergence and Restart in Branch‐and‐Bound Algorithms for Global Optimization. Application to Concave Minimization and DC‐Optimization Problems</title>
</json:item>
<json:item><author><json:item><name>H. Tuy</name>
</json:item>
<json:item><name>V. Khachaturov</name>
</json:item>
<json:item><name>S. Utkin</name>
</json:item>
</author>
<host><volume>18</volume>
<pages><last>807</last>
<first>791</first>
</pages>
<author></author>
<title>Optimization</title>
</host>
<title>A Class of Exhaustive Cone Splitting Procedures in Conical Algorithms for Concave Minimization</title>
</json:item>
<json:item><author><json:item><name>H. Tuy</name>
</json:item>
<json:item><name>N. Q. Thai</name>
</json:item>
</author>
<host><volume>8</volume>
<pages><last>20</last>
<first>12</first>
</pages>
<author></author>
<title>Acta Mathematica Vietnamica</title>
</host>
<title>Minimizing a Concave Function Over a Compact Convex Set</title>
</json:item>
<json:item><author><json:item><name>H. Tuy</name>
</json:item>
<json:item><name>T. V. Thieu</name>
</json:item>
<json:item><name>N. Q. Thai</name>
</json:item>
</author>
<host><volume>10</volume>
<pages><last>514</last>
<first>498</first>
</pages>
<author></author>
<title>Mathematics of Operations Research</title>
</host>
<title>A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set</title>
</json:item>
<json:item><author><json:item><name>H. Tuy</name>
</json:item>
<json:item><name>N. V. Thuong</name>
</json:item>
</author>
<host><volume>49</volume>
<pages><last>99</last>
<first>85</first>
</pages>
<author></author>
<title>Methods of Operations Research</title>
</host>
<title>Minimizing a Convex Function Over the Complement of a Convex Set</title>
</json:item>
<json:item><author><json:item><name>H. Tuy</name>
</json:item>
<json:item><name>N. V. Thuong</name>
</json:item>
</author>
<host><volume>18</volume>
<pages><last>142</last>
<first>119</first>
</pages>
<author></author>
<title>Applied Mathematics and Optimization</title>
</host>
<title>On the Global Minimization of a Convex Function under General Nonconvex Constraints</title>
</json:item>
<json:item><author><json:item><name>U. Ueing</name>
</json:item>
</author>
<host><pages><last>230</last>
<first>223</first>
</pages>
<author></author>
<title>Numerical Methods for Nonlinear Optimization</title>
</host>
<title>A Combinational Method to Compute the Global Solution of Certain Non‐Convex Optimization Problems</title>
</json:item>
<json:item><author><json:item><name>A. F. Veinott</name>
</json:item>
</author>
<host><volume>15</volume>
<pages><last>152</last>
<first>147</first>
</pages>
<author></author>
<title>Operations Research</title>
</host>
<title>The Supporting Hyperplane Method for Unimodal Programming</title>
</json:item>
<json:item><author><json:item><name>A. B. Zalessky</name>
</json:item>
</author>
<host><volume>16</volume>
<pages><last>1081</last>
<first>1069</first>
</pages>
<author></author>
<title>Ekonomika i Matematitcheskie Metody</title>
</host>
<title>Nonconvexity of Feasible Domains and Optimization of Management Decision</title>
</json:item>
<json:item><author><json:item><name>I. Zang</name>
</json:item>
<json:item><name>M. Avriel</name>
</json:item>
</author>
<host><volume>16</volume>
<pages><last>190</last>
<first>183</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Applications</title>
</host>
<title>On Functions whose Local Minima are Global</title>
</json:item>
<json:item><author><json:item><name>I. Zang</name>
</json:item>
<json:item><name>E. W. Choo</name>
</json:item>
<json:item><name>M. Avriel</name>
</json:item>
</author>
<host><volume>18</volume>
<pages><last>559</last>
<first>556</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Application</title>
</host>
<title>A Note on Functions whose Local Minima are Global</title>
</json:item>
<json:item><author><json:item><name>V. S. Zhirov</name>
</json:item>
</author>
<host><volume>25</volume>
<pages><last>180</last>
<first>163</first>
</pages>
<author></author>
<title>Journal of Computational Mathematics and Mathematical Physics</title>
</host>
<title>Searching for a Global Extremum of a Polynomial on a Parallelepiped</title>
</json:item>
<json:item><author><json:item><name>A. Zilinskas</name>
</json:item>
</author>
<host><volume>122</volume>
<pages><last>116</last>
<first>104</first>
</pages>
<author></author>
<title>Mathematical Programming</title>
</host>
<title>Axiomatic Approach to Statistical Models, Applications and Their Use in Multimodal Optimization Theory</title>
</json:item>
<json:item><host><author></author>
<title>Horst, R. andTuy, H.,Global Optimization ‐ Deterministic Approaches,Springer, Berlin,1990.</title>
</host>
</json:item>
</refBibs>
<genre><json:string>article</json:string>
</genre>
<host><volume>37</volume>
<publisherId><json:string>NAV</json:string>
</publisherId>
<pages><total>39</total>
<last>471</last>
<first>433</first>
</pages>
<issn><json:string>0894-069X</json:string>
</issn>
<issue>4</issue>
<subject><json:item><value>Article</value>
</json:item>
</subject>
<genre><json:string>journal</json:string>
</genre>
<language><json:string>unknown</json:string>
</language>
<eissn><json:string>1520-6750</json:string>
</eissn>
<title>Naval Research Logistics (NRL)</title>
<doi><json:string>10.1002/(ISSN)1520-6750</json:string>
</doi>
</host>
<categories><wos><json:string>science</json:string>
<json:string>operations research & management science</json:string>
</wos>
<scienceMetrix><json:string>economic & social sciences</json:string>
<json:string>economics & business </json:string>
<json:string>logistics & transportation</json:string>
</scienceMetrix>
</categories>
<publicationDate>1990</publicationDate>
<copyrightDate>1990</copyrightDate>
<doi><json:string>10.1002/1520-6750(199008)37:4>433::AID-NAV3220370403>3.0.CO;2-2</json:string>
</doi>
<id>C5521E9E073E7BCDC732AF678375CE49A4108D14</id>
<score>0.7241964</score>
<fulltext><json:item><extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/document/C5521E9E073E7BCDC732AF678375CE49A4108D14/fulltext/pdf</uri>
</json:item>
<json:item><extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/document/C5521E9E073E7BCDC732AF678375CE49A4108D14/fulltext/zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/document/C5521E9E073E7BCDC732AF678375CE49A4108D14/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Deterministic methods in constrained global optimization: Some recent advances and new fields of application</title>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher>
<pubPlace>New York</pubPlace>
<availability><p>Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company</p>
</availability>
<date>1990</date>
</publicationStmt>
<sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Deterministic methods in constrained global optimization: Some recent advances and new fields of application</title>
<author xml:id="author-1"><persName><forename type="first">Reiner</forename>
<surname>Horst</surname>
</persName>
<note type="biography">This article was written while the author was on leave at the Department of Decision and Information Sciences, University of Florida, Gainesville.</note>
<affiliation>This article was written while the author was on leave at the Department of Decision and Information Sciences, University of Florida, Gainesville.</affiliation>
<affiliation>Fachbereich IV—Mathematik, Universitaet Trier, Postfach 3825, D‐55 Trier, Federal Republic of Germany</affiliation>
</author>
</analytic>
<monogr><title level="j">Naval Research Logistics (NRL)</title>
<title level="j" type="abbrev">Naval Research Logistics</title>
<idno type="pISSN">0894-069X</idno>
<idno type="eISSN">1520-6750</idno>
<idno type="DOI">10.1002/(ISSN)1520-6750</idno>
<imprint><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher>
<pubPlace>New York</pubPlace>
<date type="published" when="1990-08"></date>
<biblScope unit="volume">37</biblScope>
<biblScope unit="issue">4</biblScope>
<biblScope unit="page" from="433">433</biblScope>
<biblScope unit="page" to="471">471</biblScope>
</imprint>
</monogr>
<idno type="istex">C5521E9E073E7BCDC732AF678375CE49A4108D14</idno>
<idno type="DOI">10.1002/1520-6750(199008)37:4<433::AID-NAV3220370403>3.0.CO;2-2</idno>
<idno type="ArticleID">NAV3220370403</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><creation><date>1990</date>
</creation>
<langUsage><language ident="en">en</language>
</langUsage>
<abstract xml:lang="en"><p>Recent developments in deterministic global optimization methods have considerably enlarged the fields of optimization where those methods can be successfully applied. It is the purpose of the present article to give a brief survey of both some of the most promising methods and new fields of application. The methods considered comprise branch and bound and outer approximation as well as combinations of branch and bound with outer approximation. The fields of applications to be discussed include concave minimization, reverse convex programming, d.c. programming, Lipschitzian optimization, systems of equations, and (or) inequalities and global integer programming.</p>
</abstract>
<textClass><keywords scheme="Journal Subject"><list><head>article-category</head>
<item><term>Article</term>
</item>
</list>
</keywords>
</textClass>
</profileDesc>
<revisionDesc><change when="1990-08">Published</change>
</revisionDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item><extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/document/C5521E9E073E7BCDC732AF678375CE49A4108D14/fulltext/txt</uri>
</json:item>
</fulltext>
<metadata><istex:metadataXml wicri:clean="Wiley, elements deleted: body"><istex:xmlDeclaration>version="1.0" encoding="UTF-8" standalone="yes"</istex:xmlDeclaration>
<istex:document><component version="2.0" type="serialArticle" xml:lang="en"><header><publicationMeta level="product"><publisherInfo><publisherName>Wiley Subscription Services, Inc., A Wiley Company</publisherName>
<publisherLoc>New York</publisherLoc>
</publisherInfo>
<doi registered="yes">10.1002/(ISSN)1520-6750</doi>
<issn type="print">0894-069X</issn>
<issn type="electronic">1520-6750</issn>
<idGroup><id type="product" value="NAV"></id>
</idGroup>
<titleGroup><title type="main" xml:lang="en" sort="NAVAL RESEARCH LOGISTICS NRL">Naval Research Logistics (NRL)</title>
<title type="short">Naval Research Logistics</title>
</titleGroup>
</publicationMeta>
<publicationMeta level="part" position="40"><doi origin="wiley" registered="yes">10.1002/1520-6750(199008)37:4<>1.0.CO;2-1</doi>
<numberingGroup><numbering type="journalVolume" number="37">37</numbering>
<numbering type="journalIssue">4</numbering>
</numberingGroup>
<coverDate startDate="1990-08">August 1990</coverDate>
</publicationMeta>
<publicationMeta level="unit" type="article" position="3" status="forIssue"><doi origin="wiley" registered="yes">10.1002/1520-6750(199008)37:4<433::AID-NAV3220370403>3.0.CO;2-2</doi>
<idGroup><id type="unit" value="NAV3220370403"></id>
</idGroup>
<countGroup><count type="pageTotal" number="39"></count>
</countGroup>
<titleGroup><title type="articleCategory">Article</title>
<title type="tocHeading1">Articles</title>
</titleGroup>
<copyright ownership="publisher">Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company</copyright>
<eventGroup><event type="firstOnline" date="2006-10-10"></event>
<event type="publishedOnlineFinalForm" date="2006-10-10"></event>
<event type="xmlConverted" agent="Converter:JWSART34_TO_WML3G version:2.3.2 mode:FullText source:HeaderRef result:HeaderRef" date="2010-03-09"></event>
<event type="xmlConverted" agent="Converter:WILEY_ML3G_TO_WILEY_ML3GV2 version:3.8.8" date="2014-02-03"></event>
<event type="xmlConverted" agent="Converter:WML3G_To_WML3G version:4.1.7 mode:FullText,remove_FC" date="2014-10-31"></event>
</eventGroup>
<numberingGroup><numbering type="pageFirst">433</numbering>
<numbering type="pageLast">471</numbering>
</numberingGroup>
<linkGroup><link type="toTypesetVersion" href="file:NAV.NAV3220370403.pdf"></link>
</linkGroup>
</publicationMeta>
<contentMeta><countGroup><count type="figureTotal" number="0"></count>
<count type="tableTotal" number="0"></count>
<count type="referenceTotal" number="174"></count>
</countGroup>
<titleGroup><title type="main" xml:lang="en">Deterministic methods in constrained global optimization: Some recent advances and new fields of application</title>
<title type="short" xml:lang="en">Deterministic Methods</title>
</titleGroup>
<creators><creator xml:id="au1" creatorRole="author" affiliationRef="#af1" noteRef="#fn1"><personName><givenNames>Reiner</givenNames>
<familyName>Horst</familyName>
</personName>
</creator>
</creators>
<affiliationGroup><affiliation xml:id="af1" countryCode="DE" type="organization"><unparsedAffiliation>Fachbereich IV—Mathematik, Universitaet Trier, Postfach 3825, D‐55 Trier, Federal Republic of Germany</unparsedAffiliation>
</affiliation>
</affiliationGroup>
<abstractGroup><abstract type="main" xml:lang="en"><title type="main">Abstract</title>
<p>Recent developments in deterministic global optimization methods have considerably enlarged the fields of optimization where those methods can be successfully applied. It is the purpose of the present article to give a brief survey of both some of the most promising methods and new fields of application. The methods considered comprise branch and bound and outer approximation as well as combinations of branch and bound with outer approximation. The fields of applications to be discussed include concave minimization, reverse convex programming, d.c. programming, Lipschitzian optimization, systems of equations, and (or) inequalities and global integer programming.</p>
</abstract>
</abstractGroup>
</contentMeta>
<noteGroup><note xml:id="fn1"><p>This article was written while the author was on leave at the Department of Decision and Information Sciences, University of Florida, Gainesville.</p>
</note>
</noteGroup>
</header>
</component>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>Deterministic methods in constrained global optimization: Some recent advances and new fields of application</title>
</titleInfo>
<titleInfo type="abbreviated" lang="en"><title>Deterministic Methods</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA" lang="en"><title>Deterministic methods in constrained global optimization: Some recent advances and new fields of application</title>
</titleInfo>
<name type="personal"><namePart type="given">Reiner</namePart>
<namePart type="family">Horst</namePart>
<affiliation>Fachbereich IV—Mathematik, Universitaet Trier, Postfach 3825, D‐55 Trier, Federal Republic of Germany</affiliation>
<description>This article was written while the author was on leave at the Department of Decision and Information Sciences, University of Florida, Gainesville.</description>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre type="article" displayLabel="article"></genre>
<originInfo><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher>
<place><placeTerm type="text">New York</placeTerm>
</place>
<dateIssued encoding="w3cdtf">1990-08</dateIssued>
<copyrightDate encoding="w3cdtf">1990</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<physicalDescription><internetMediaType>text/html</internetMediaType>
<extent unit="references">174</extent>
</physicalDescription>
<abstract lang="en">Recent developments in deterministic global optimization methods have considerably enlarged the fields of optimization where those methods can be successfully applied. It is the purpose of the present article to give a brief survey of both some of the most promising methods and new fields of application. The methods considered comprise branch and bound and outer approximation as well as combinations of branch and bound with outer approximation. The fields of applications to be discussed include concave minimization, reverse convex programming, d.c. programming, Lipschitzian optimization, systems of equations, and (or) inequalities and global integer programming.</abstract>
<relatedItem type="host"><titleInfo><title>Naval Research Logistics (NRL)</title>
</titleInfo>
<titleInfo type="abbreviated"><title>Naval Research Logistics</title>
</titleInfo>
<genre type="journal">journal</genre>
<subject><genre>article-category</genre>
<topic>Article</topic>
</subject>
<identifier type="ISSN">0894-069X</identifier>
<identifier type="eISSN">1520-6750</identifier>
<identifier type="DOI">10.1002/(ISSN)1520-6750</identifier>
<identifier type="PublisherID">NAV</identifier>
<part><date>1990</date>
<detail type="volume"><caption>vol.</caption>
<number>37</number>
</detail>
<detail type="issue"><caption>no.</caption>
<number>4</number>
</detail>
<extent unit="pages"><start>433</start>
<end>471</end>
<total>39</total>
</extent>
</part>
</relatedItem>
<identifier type="istex">C5521E9E073E7BCDC732AF678375CE49A4108D14</identifier>
<identifier type="DOI">10.1002/1520-6750(199008)37:4<433::AID-NAV3220370403>3.0.CO;2-2</identifier>
<identifier type="ArticleID">NAV3220370403</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company</accessCondition>
<recordInfo><recordContentSource>WILEY</recordContentSource>
<recordOrigin>Wiley Subscription Services, Inc., A Wiley Company</recordOrigin>
</recordInfo>
</mods>
</metadata>
<serie></serie>
</istex>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001175 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001175 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Istex
   |étape=   Corpus
   |type=    RBID
   |clé=     ISTEX:C5521E9E073E7BCDC732AF678375CE49A4108D14
   |texte=   Deterministic methods in constrained global optimization: Some recent advances and new fields of application
}}

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024

	Serveur d'exploration sur l'Université de Trèves
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur l'Université de Trèves

Deterministic methods in constrained global optimization: Some recent advances and new fields of application

Deterministic methods in constrained global optimization: Some recent advances and new fields of application

Source :

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri