{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:18:39Z","timestamp":1648909119509},"reference-count":10,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1986,3,1]],"date-time":"1986-03-01T00:00:00Z","timestamp":510019200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10000,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1986,3]]},"DOI":"10.1016\/0166-218x(86)90086-7","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"249-257","source":"Crossref","is-referenced-by-count":1,"title":["The family constrained network problem"],"prefix":"10.1016","volume":"13","author":[{"given":"John","family":"Mote","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(86)90086-7_BIB1","year":"1983","journal-title":"ARCNET User's Guide"},{"key":"10.1016\/0166-218X(86)90086-7_BIB2","first-page":"16","article-title":"Enhancements of spanning tree labeling procedures for network optimization","volume":"17","author":"Barr","year":"1979","journal-title":"INFOR"},{"key":"10.1016\/0166-218X(86)90086-7_BIB3","series-title":"Management Models and Industrial Applications of Linear Programming","author":"Charnes","year":"1961"},{"key":"10.1016\/0166-218X(86)90086-7_BIB4","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1287\/mnsc.12.7.576","article-title":"An algorithm for the solution of mixed integer programming problems","volume":"12","author":"Driebeek","year":"1966","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(86)90086-7_BIB5","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1287\/opre.14.3.361","article-title":"A branch-bound algorithm for plant location","volume":"14","author":"Efroymson","year":"1966","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(86)90086-7_BIB6","article-title":"A performance comparison of labeling algorithms for calculating shortest path trees","volume":"772","author":"Gilsinn","year":"1973"},{"key":"10.1016\/0166-218X(86)90086-7_BIB7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1287\/inte.9.5.21","article-title":"An integrated production, distribution, and inventory planning system","volume":"9","author":"Glover","year":"1979","journal-title":"Interfaces"},{"key":"10.1016\/0166-218X(86)90086-7_BIB8","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/nav.3800150306","article-title":"The fixed charge problem","volume":"15","author":"Hirsch","year":"1968","journal-title":"Naval res. Logist. Quart."},{"key":"10.1016\/0166-218X(86)90086-7_BIB9","doi-asserted-by":"crossref","first-page":"1362","DOI":"10.1287\/mnsc.30.11.1362","article-title":"Topological and computational aspects of preemptive multicriteria military personnel assignment problems","volume":"30","author":"Klingman","year":"1984","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(86)90086-7_BIB10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/nav.3800230108","article-title":"Solving fixed charge network problems with group theory based penalties","volume":"23","author":"Rardin","year":"1976","journal-title":"Naval Res. Logist. Quart."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X86900867?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X86900867?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T11:56:32Z","timestamp":1553946992000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X86900867"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":10,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["0166218X86900867"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(86)90086-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}