<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="B">   <ARLID>0499242</ARLID> <utime>20240103221253.3</utime><mtime>20190107235959.9</mtime>    <ISBN>978-1-78923-676-7</ISBN>   <DOI>10.5772/intechopen.71370</DOI>           <title language="eng" primary="1">OPTIMIZATION ALGORITHMS - EXAMPLES</title>  <publisher> <place>London</place> <name>IntechOpen</name> <pub_time>2018</pub_time> </publisher> <specification> <page_count>136 s.</page_count> <media_type>P</media_type> </specification>    <keyword>Optimization</keyword>   <keyword>Algorithms</keyword>   <keyword>Non-linear</keyword>    <author primary="1"> <ARLID>cav_un_auth*0292941</ARLID> <name1>Valdman</name1> <name2>Jan</name2> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept language="eng">Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department language="eng">MTR</department> <institution>UTIA-B</institution> <full_dept>Department of Decision Making Theory</full_dept> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2018/MTR/valdman-0499242.pdf</url> </source> <source> <url>https://www.intechopen.com/books/optimization-algorithms-examples</url> </source>         <cas_special> <project> <ARLID>cav_un_auth*0292653</ARLID> <project_id>GA13-18652S</project_id> <agency>GA ČR</agency> </project> <project> <ARLID>cav_un_auth*0331681</ARLID> <project_id>GF16-34894L</project_id> <agency>GA ČR</agency> <country>CZ</country> </project> <project> <ARLID>cav_un_auth*0347023</ARLID> <project_id>GA17-04301S</project_id> <agency>GA ČR</agency> </project> <project> <ARLID>cav_un_auth*0342514</ARLID> <project_id>7AMB16AT015</project_id> <agency>GA MŠk</agency> <country>CZ</country> </project>  <abstract language="eng" primary="1">This book presents examples of modern optimization algorithms. The focus is on a clear understanding of underlying studied problems, understanding described algorithms by a broad range of scientists and providing (computational) examples that a reader can easily repeat.</abstract>     <RIV>BA</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10102</FORD2>   <reportyear>2019</reportyear>     <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0291473</permalink>   <confidential>S</confidential>        <arlyear>2018</arlyear>       <unknown tag="mrcbU10"> 2018 </unknown> <unknown tag="mrcbU10"> London IntechOpen </unknown> <unknown tag="mrcbU12"> 978-1-78923-676-7 </unknown> <unknown tag="mrcbU14"> SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> WOS </unknown> </cas_special> </bibitem>