{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:05:18Z","timestamp":1759104318037,"version":"3.44.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4307,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["95-01-00989","97-01-00890"],"award-info":[{"award-number":["95-01-00989","97-01-00890"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0166-218x(00)00357-7","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"13-22","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix"],"prefix":"10.1016","volume":"114","author":[{"given":"V.L.","family":"Beresnev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00357-7_BIB1","unstructured":"A.A. Ageev, On complexity of minimization problems for polynomials in Boolean variables, Upravlyaemye Sistemy, 23 (1983) 3\u201311 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00357-7_BIB2","unstructured":"V.L. Beresnev, An algorithm of implicit enumeration for the location and standardization type of problem, Upravlyaemye Sistemy, 12 (1974) 24\u201334 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00357-7_BIB3","unstructured":"V.L. Beresnev, An algorithm of minimization of polynomials in Boolean variables, Problemy Kibernetiki, 36 (1979) 225\u2013246 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00357-7_BIB4","unstructured":"V.L. Beresnev, E.Kh. Gimadi, V.T. Dement'ev, Standardization extremal problems, Nauka, Novosibirsk, (1978) (in Russian)."},{"key":"10.1016\/S0166-218X(00)00357-7_BIB5","unstructured":"V.P. Grishukhin, Polynomiality in the simple plant location problem, Centr. Econ.-Math Institute of USSR Acad. of Sci. (1978), preprint (in Russian)."},{"issue":"2","key":"10.1016\/S0166-218X(00)00357-7_BIB6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/opre.17.2.233","article-title":"Pseudo-Boolean programming","volume":"17","author":"Hammer","year":"1969","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/S0166-218X(00)00357-7_BIB7","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0606070","article-title":"Totally-balanced and greedy matrices","volume":"6","author":"Hoffman","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"10.1016\/S0166-218X(00)00357-7_BIB8","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","article-title":"The simple plant location problem: survey and synthesis","volume":"12","author":"Krarup","year":"1983","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(00)00357-7_BIB9","unstructured":"V.A. Trubin, An efficient algorithm of location on a tree-shaped network, Docl. Acad. Nauk SSSR. 231 (3) (1976) 547\u2013550 (in Russian)."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003577?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003577?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T11:56:57Z","timestamp":1759060617000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X00003577"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00357-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2001,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(00)00357-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}