<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0638001</ARLID> <utime>20250902082644.7</utime><mtime>20250812235959.9</mtime>   <SCOPUS>105002901919</SCOPUS>  <DOI>10.1007/s43069-025-00452-x</DOI>           <title language="eng" primary="1">A Probabilistic Formulation of Problem of Optimal Search for a Lost Person</title>  <specification> <page_count>13 s.</page_count> <media_type>E</media_type> </specification>   <serial><ARLID>cav_un_epca*0638000</ARLID><ISSN>26622556</ISSN><title>Operations Research Forum</title><part_num/><part_title/><volume_id>6</volume_id><volume/></serial>    <keyword>Search and rescue</keyword>   <keyword>Optimal search</keyword>   <keyword>Discrete probability</keyword>   <keyword>Bayes rule</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101227</ARLID> <name1>Volf</name1> <name2>Petr</name2> <institution>UTIA-B</institution> <full_dept language="cz">Stochastická informatika</full_dept> <full_dept language="eng">Department of Stochastic Informatics</full_dept> <department language="cz">SI</department> <department language="eng">SI</department> <full_dept>Department of Stochastic Informatics</full_dept>  <share>100</share> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>https://library.utia.cas.cz/separaty/2025/SI/volf-0638001.pdf</url> </source> <source> <url>https://link.springer.com/article/10.1007/s43069-025-00452-x</url>  </source>        <cas_special>  <abstract language="eng" primary="1">This paper deals with a simple probabilistic description of some issues related to searching for a missing person.They concern at least two interesting points of the application of mathematics in managerial decision-making. First, we propose the use of Bayes’ rule to recalculate the probability of a lost person location based on additional information. Next, the optimal ordering of searched areas is determined that minimizes the average (expected) search time. Finally, the proposed solutions is illustrated with several artificial examples.</abstract>     <result_subspec>SCOPUS</result_subspec> <RIV>BB</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10102</FORD2>    <reportyear>2026</reportyear>      <num_of_auth>1</num_of_auth>  <inst_support> RVO:67985556 </inst_support>  <permalink>https://hdl.handle.net/11104/0369142</permalink>   <confidential>S</confidential>  <article_num> 52 </article_num> <unknown tag="mrcbC91"> A </unknown>       <arlyear>2025</arlyear>       <unknown tag="mrcbU14"> 105002901919 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0638000 Operations Research Forum 6 2 2025 26622556 </unknown> </cas_special> </bibitem>