{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:37:55Z","timestamp":1777703875396,"version":"3.51.4"},"reference-count":21,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5703,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1991,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This article is concerned with the problem of locating <jats:italic>p<\/jats:italic> capacitated facilities on a chain graph and simultaneously determining the allocation of their supplies in order to satisfy a continuum of demand. The demand is characterized by some weighted probability density functions defined on the chain graph. The objective is to minimize the total (expected) trnasportation cost. This location\u2010allocation problem is also referred to as the capacitated <jats:italic>p<\/jats:italic>\u2010median problem on a chain graph. Two unbalanced cases of this problem are considered, namely, the overcapacitated case when total supply exceeds total demand and the deficit capacity case when total supply is less than total demand. Both these problems are nonconvex and are shown to be NP\u2010hard even if the demand density function is piecewise uniform and positive. We provide a first\u2010order characterization of optimality for these two problems and prescribe an enumerative algorithm based on a partitioning of the dual space in order to optimally solve these problems. An extension of these algorithms for solving the unbalanced, capacitated 2\u2010median problem on a tree graph is also given.<\/jats:p>","DOI":"10.1002\/net.3230210202","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T10:23:19Z","timestamp":1178965399000},"page":"133-163","source":"Crossref","is-referenced-by-count":9,"title":["Unbalanced, capacitated <i>p<\/i>\u2010median problems on a chain graph with a continuum of link demands"],"prefix":"10.1002","volume":"21","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas P.","family":"Rizzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"The Elements of Real Analysis","author":"Bartle R. G.","year":"1976"},{"key":"e_1_2_1_3_2","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"Bazaraa M. S.","year":"1979"},{"key":"e_1_2_1_4_2","unstructured":"M. L.Brandeau S. S.Chiu andR.Batta Locating the two\u2010median of a tree network with continuous link demands. Working paper Engineering\u2010Economic Systems Department Stanford University Stanford CA 94305 (1984)."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(86)90244-4"},{"key":"e_1_2_1_6_2","unstructured":"S. S.Chiu The minisum location problem on an undirected network with continuous link demands. Presented at the Joint National ORSA\/TIMS Meeting San Diego (1982)."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.30.4.745"},{"key":"e_1_2_1_8_2","volume-title":"Computers and Intractability: A Guide to the Theory of NP\u2010Completeness","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.3.450"},{"key":"e_1_2_1_10_2","volume-title":"Location on Networks","author":"Handler G. Y.","year":"1979"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1137\/0137041"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1967.73"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.25.4.641"},{"key":"e_1_2_1_14_2","volume-title":"Optimization Algorithms for Networks and Graphs","author":"Minieka E.","year":"1978"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.4.878"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.13.1.32"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.22.1.70"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.29.3.523"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.7.2.183"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.29.4.482"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.29.4.498"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.1.145"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230210202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230210202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T07:09:09Z","timestamp":1698044949000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230210202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["10.1002\/net.3230210202"],"URL":"https:\/\/doi.org\/10.1002\/net.3230210202","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}