{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T05:43:52Z","timestamp":1649137432839},"reference-count":0,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T00:00:00Z","timestamp":1589328000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,5,13]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The paper describes a simulator of parallel Branch and Bound (BnB) method. Several subdomain trees for benchmark functions are analyzed, a characteristic Gaussian-like distribution is discovered. An algorithm of artificial tree generation is formulated according to this criterion. The process of simulator modeling is described, several computational experiments are conducted. Their results show a hyperbolic decrease trend for modeled time as the number of computational units grows, which is concluded to be similar to real systems.<\/jats:p>","DOI":"10.1515\/comp-2020-0115","type":"journal-article","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T10:28:38Z","timestamp":1590402518000},"page":"112-116","source":"Crossref","is-referenced-by-count":0,"title":["Tool for Simulating Branch and Bound Computations"],"prefix":"10.1515","volume":"10","author":[{"given":"Andrei","family":"Ignatov","sequence":"first","affiliation":[{"name":"National Research University Higher School of Economics,Moscow, Russia; Federal Research Center \u201cComputer Science and Control\u201d of Russian Academy of Sciences, Moscow, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Gorchakov","sequence":"additional","affiliation":[{"name":"Federal Research Center \u201cComputer Science and Control\u201d of Russian Academy of Sciences, Moscow, Russia; Moscow Institute of Physics and Technology, Dolgoprudnyi, Moscow oblast, Russia; National Research University Higher School of Economics, Moscow, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","container-title":["Open Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/comp\/10\/1\/article-p112.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/downloadpdf\/journals\/comp\/10\/1\/article-p112.xml","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,28]],"date-time":"2021-02-28T03:22:39Z","timestamp":1614482559000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2020-0115\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,13]]},"references-count":0,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1515\/comp-2020-0115","relation":{},"ISSN":["2299-1093"],"issn-type":[{"value":"2299-1093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,13]]}}}