{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:59:59Z","timestamp":1740182399010,"version":"3.37.3"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,8,29]],"date-time":"2020-08-29T00:00:00Z","timestamp":1598659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,29]],"date-time":"2020-08-29T00:00:00Z","timestamp":1598659200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN Oper. Res. Forum"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s43069-020-00022-3","type":"journal-article","created":{"date-parts":[[2020,8,29]],"date-time":"2020-08-29T11:02:42Z","timestamp":1598698962000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Combinatorial Solution for Bridge and Torch Problem"],"prefix":"10.1007","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2718-8133","authenticated-orcid":false,"given":"Marilena","family":"Jianu","sequence":"first","affiliation":[]},{"given":"Mihail","family":"Jianu","sequence":"additional","affiliation":[]},{"given":"Sever Angel","family":"Popescu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,29]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Backhouse R (2008) The Capacity-C torch problem. In: Audebaud P, Paulin-Mohring C (eds) Mathematics of program construction, MPC 2008, LNCS, Springer, vol 5133, pp 57\u201378","DOI":"10.1007\/978-3-540-70594-9_5"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.scico.2015.01.003","volume":"102","author":"R Backhouse","year":"2015","unstructured":"Backhouse R, Truong H (2015) The Capacity-C torch problem. Sci Comput Program 102:76\u2013107","journal-title":"Sci Comput Program"},{"issue":"3","key":"22_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1017\/S0956796804005040","volume":"14","author":"M Erwig","year":"2004","unstructured":"Erwig M (2004) Escape from Zurg: an exercise in logic programming. J Funct Program 14(3):253\u2013261","journal-title":"J Funct Program"},{"key":"22_CR4","first-page":"241","volume":"78","author":"G Rote","year":"2002","unstructured":"Rote G (2002) Crossing the bridge at night. BEATCS 78:241\u2013246","journal-title":"BEATCS"},{"key":"22_CR5","unstructured":"Steinegger R (2016) A systematic solution to the bridge and torch riddle. https:\/\/digitalcollection.zhaw.ch\/bitstream\/11475\/1902\/1\/Steinegger_Bridge_and_Torch_Riddle_Combinatorics.pdf"}],"container-title":["SN Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-020-00022-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-020-00022-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-020-00022-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,28]],"date-time":"2021-08-28T23:25:22Z","timestamp":1630193122000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-020-00022-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,29]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["22"],"URL":"https:\/\/doi.org\/10.1007\/s43069-020-00022-3","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2020,8,29]]},"assertion":[{"value":"12 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}],"article-number":"21"}}