<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">465774199</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180323111937.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170327e19901201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF02023058</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF02023058</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Combinatorial optimization by stochastic automata</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Eugene Shragowitz, Rung-Bin Lin]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">The significance of combinatorial optimization for many important applications is well understood. The simulated annealing algorithm (which we will denote from here on as SA) has generated great interest and attention in the scientific community. Its authors derived it from analogies to the physical domain [15,10], and a myriad of publications followed (see references to the book on simulated annealing in [11]). The prevailing opinion expressed in these publications was that the SA algorithm represents a new, hitherto unknown class of algorithms and provides a breakthrough in the solution of NP-hard optimization problems. As might be expected, roots of the SA do exist, and one of the purposes of this paper is to trace these roots. We prove that SA, like many other randomized algorithms, belongs to the class of S-type GH-stochastic automata. We provide other representatives of this class together with algorithms from some other classes, and discuss the issue of convergence. Large computational experiemts were performed on a network of Apollo computers.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">J.C. Baltzer AG, Scientific Publishing Company, 1990</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Shragowitz</subfield>
   <subfield code="D">Eugene</subfield>
   <subfield code="u">Department of Computer Science, EE/CSci. Bldg., University of Minnesota, 200 Union Street SE, 55455, Minneapolis, Minnesota, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Lin</subfield>
   <subfield code="D">Rung-Bin</subfield>
   <subfield code="u">Department of Computer Science, EE/CSci. Bldg., University of Minnesota, 200 Union Street SE, 55455, Minneapolis, Minnesota, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Annals of Operations Research</subfield>
   <subfield code="d">Baltzer Science Publishers, Baarn/Kluwer Academic Publishers</subfield>
   <subfield code="g">22/1(1990-12-01), 293-324</subfield>
   <subfield code="x">0254-5330</subfield>
   <subfield code="q">22:1&lt;293</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">22</subfield>
   <subfield code="o">10479</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF02023058</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/BF02023058</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Shragowitz</subfield>
   <subfield code="D">Eugene</subfield>
   <subfield code="u">Department of Computer Science, EE/CSci. Bldg., University of Minnesota, 200 Union Street SE, 55455, Minneapolis, Minnesota, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Lin</subfield>
   <subfield code="D">Rung-Bin</subfield>
   <subfield code="u">Department of Computer Science, EE/CSci. Bldg., University of Minnesota, 200 Union Street SE, 55455, Minneapolis, Minnesota, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Annals of Operations Research</subfield>
   <subfield code="d">Baltzer Science Publishers, Baarn/Kluwer Academic Publishers</subfield>
   <subfield code="g">22/1(1990-12-01), 293-324</subfield>
   <subfield code="x">0254-5330</subfield>
   <subfield code="q">22:1&lt;293</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">22</subfield>
   <subfield code="o">10479</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
