{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:30:35Z","timestamp":1720693835990},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1990,11]]},"DOI":"10.1007\/bf01588799","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T12:19:53Z","timestamp":1114690793000},"page":"381-396","source":"Crossref","is-referenced-by-count":8,"title":["Capacitated, balanced, sequential location-allocation problems on chains and trees"],"prefix":"10.1007","volume":"49","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/0377-2217(86)90244-4","volume":"23","author":"T.M. Cavalier","year":"1986","unstructured":"T.M. Cavalier and H.D. Sherali, \u201cNetwork location problems with continuous link demands:p-medians on a chain and 2-medians on a tree,\u201dEuropean Journal of Operational Research 23 (1986) 246\u2013255.","journal-title":"European Journal of Operational Research"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01582049","volume":"32","author":"T.M. Cavalier","year":"1985","unstructured":"T.M. Cavalier and H.D. Sherali, \u201cSequential location-allocation problems on chains and trees with probabilistic link demands,\u201dMathematical Programming 32 (1985) 249\u2013277.","journal-title":"Mathematical Programming"},{"key":"CR3","unstructured":"Samuel S. Chiu, \u201cThe minisum location problem on an undirected network with continuous link demands,\u201d Presented at theJoint National ORSA\/TIMS Meeting, San Diego (November, 1982)."},{"issue":"4","key":"CR4","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1287\/opre.30.4.745","volume":"30","author":"E.V. Denardo","year":"1982","unstructured":"E.V. Denardo, G. Huberman and U.G. Rothblum, \u201cOptimal locations on a line are interleaved,\u201dOperations Research 30(4) (1982) 745\u2013759.","journal-title":"Operations Research"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"S.L. Hakimi","year":"1964","unstructured":"S.L. Hakimi, \u201cOptimal locations of switching centers and the absolute centers and medians of a graph,\u201dOperations Research 12 (1964) 450\u2013459.","journal-title":"Operations Research"},{"key":"CR6","volume-title":"Location on Networks","author":"G.Y. Handler","year":"1979","unstructured":"G.Y. Handler and P.B. Mirchandani,Location on Networks (The MIT Press, Cambridge, MA, 1979)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01580367","volume":"11","author":"H. Konno","year":"1976","unstructured":"H. Konno, \u201cA cutting plane algorithm for solving bilinear programs,\u201dMathematical Programming 11 (1976) 14\u201327.","journal-title":"Mathematical Programming"},{"issue":"4","key":"CR8","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1287\/opre.25.4.641","volume":"25","author":"E. Minieka","year":"1977","unstructured":"E. Minieka, \u201cThe centers and medians of a graph,\u201dOperations Research 25(4) (1977) 641\u2013650.","journal-title":"Operations Research"},{"issue":"3","key":"CR9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/net.3230100307","volume":"10","author":"E. Minieka","year":"1980","unstructured":"E. Minieka, \u201cConditional centers and medians of a graph,\u201dNetworks 10(3) (1980) 265\u2013272.","journal-title":"Networks"},{"issue":"2","key":"CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1111\/j.1538-4632.1970.tb00149.x","volume":"2","author":"A.J. Scott","year":"1970","unstructured":"A.J. Scott, \u201cLocation-allocation systems: a review,\u201dGeographical Analysis 2(2) (1970) 95\u2013119.","journal-title":"Geographical Analysis"},{"issue":"4","key":"CR11","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1287\/opre.32.4.878","volume":"32","author":"H.D. Sherali","year":"1984","unstructured":"H.D. Sherali and W.P. Adams, \u201cA decomposition algorithm for a discrete location-allocation problem,\u201dOperations Research 32(4) (1984) 878\u2013900.","journal-title":"Operations Research"},{"issue":"1","key":"CR12","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1287\/moor.13.1.32","volume":"13","author":"H.D. Sherali","year":"1988","unstructured":"H.D. Sherali and F.L. Nordai, \u201cNP-hard, capacitated, balancedp-median problems on a chain graph with a continuum of link demands,\u201dMathematics of Operations Research 13(1) (1988a) 32\u201349.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"CR13","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/trsc.22.1.70","volume":"22","author":"H.D. Sherali","year":"1988","unstructured":"H.D. Sherali and F.L. Nordai, \u201cA capacitated, balanced, 2-median location-allocation problem on a tree network with a continuum of link demands,\u201dTransportation Science 22(1) (1988b) 70\u201373.","journal-title":"Transportation Science"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01581626","volume":"19","author":"H.D. Sherali","year":"1980","unstructured":"H.D. Sherali and C.M. Shetty, \u201cA finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts,\u201dMathematical Programming 19 (1980) 14\u201331.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588799.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01588799\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:36:27Z","timestamp":1556897787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01588799"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["BF01588799"],"URL":"https:\/\/doi.org\/10.1007\/bf01588799","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}