{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T14:08:10Z","timestamp":1745417290672},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,12,2]],"date-time":"2017-12-02T00:00:00Z","timestamp":1512172800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"IPM","award":["96900422"],"award-info":[{"award-number":["96900422"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10288-017-0366-y","type":"journal-article","created":{"date-parts":[[2017,12,2]],"date-time":"2017-12-02T10:20:58Z","timestamp":1512210058000},"page":"343-377","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An algorithm for generalized constrained multi-source Weber problem with demand substations"],"prefix":"10.1007","volume":"16","author":[{"given":"S.","family":"Nobakhtian","sequence":"first","affiliation":[]},{"given":"A.","family":"Raeisi Dehkordi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,2]]},"reference":[{"key":"366_CR1","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1016\/j.ejor.2008.10.014","volume":"198","author":"IK Altinel","year":"2009","unstructured":"Altinel IK, Durmaz E, Aras N, \u00d6zksack KC (2009) A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations. Eur J Oper Res 198:790\u2013799","journal-title":"Eur J Oper Res"},{"key":"366_CR2","first-page":"186","volume":"199","author":"MB Aryanezhad","year":"2008","unstructured":"Aryanezhad MB, Hemati M (2008) A new genetic algorithm for solving nonconvex nonlinear programming problems. Appl Math Comput 199:186\u2013194","journal-title":"Appl Math Comput"},{"key":"366_CR3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke HH, Borwein JM (1996) On projection algorithms for solving convex feasibility problems. SIAM Rev 38:367\u2013426","journal-title":"SIAM Rev"},{"key":"366_CR4","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s11228-013-0239-2","volume":"21","author":"HH Bauschke","year":"2013","unstructured":"Bauschke HH, Luke DR, Phan HM, Wang X (2013) Restricted normal cones and the method of alternating projections: theory. Set Valued Anal 21:431\u2013473","journal-title":"Set Valued Anal"},{"key":"366_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/0471787779","volume-title":"Nonlinear programming: theory and algorithms","author":"MS Bazara","year":"2006","unstructured":"Bazara MS, Sherali HD, Shetty CM (2006) Nonlinear programming: theory and algorithms. Wiley, New York"},{"key":"366_CR6","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ejor.2005.10.061","volume":"177","author":"M Bischoff","year":"2007","unstructured":"Bischoff M, Klamroth K (2007) An efficient solution method for Weber problems with barriers based on genetic algorithms. Eur J Oper Res 177:22\u201341","journal-title":"Eur J Oper Res"},{"issue":"1","key":"366_CR7","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1137\/130919052","volume":"24","author":"JM Borwein","year":"2014","unstructured":"Borwein JM, Li G, Yao L (2014) Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets. SIAM J Optim 24(1):498\u2013527","journal-title":"SIAM J Optim"},{"issue":"3","key":"366_CR8","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.48.3.444.12431","volume":"48","author":"J Brimberg","year":"2000","unstructured":"Brimberg J, Hansen P, Mladenovic N, Taillard ED (2000) Improvements and comparison of heuristics for solving the uncapacitated multi source Weber problem. Oper Res 48(3):444\u2013460","journal-title":"Oper Res"},{"key":"366_CR9","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1002\/(SICI)1520-6750(200002)47:1<77::AID-NAV5>3.0.CO;2-#","volume":"47","author":"J Brimberg","year":"2000","unstructured":"Brimberg J, Wesolowsky GO (2000) Note: facility location with closest rectangular distances. Nav Res Logist 47:77\u201384","journal-title":"Nav Res Logist"},{"issue":"6","key":"366_CR10","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/S0305-0548(00)00106-4","volume":"29","author":"J Brimberg","year":"2002","unstructured":"Brimberg J, Wesolowsky GO (2002a) Locating facilities by minimax relative to closest points of demand areas. Comput Oper Res 29(6):625\u2013636","journal-title":"Comput Oper Res"},{"key":"366_CR11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/A:1020901719463","volume":"111","author":"J Brimberg","year":"2002","unstructured":"Brimberg J, Wesolowsky GO (2002b) Minisum location with closest Euclidean distances. Ann Oper Res 111:151\u2013165","journal-title":"Ann Oper Res"},{"issue":"1","key":"366_CR12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1080\/07408179308964268","volume":"25","author":"DJ Buchanan","year":"1993","unstructured":"Buchanan DJ, Wesolowsky GO (1993) Locating a noxious facility with respect to several polygonal regions using asymmetric distances. IIE Trans 25(1):77\u201388","journal-title":"IIE Trans"},{"key":"366_CR13","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.ejor.2011.09.006","volume":"217","author":"MS Canbolat","year":"2012","unstructured":"Canbolat MS, Wesolowsky GO (2012) On the use of the Varignon frame for single facility Weber problems in the presence of convex barriers. Eur J Oper Res 217:241\u2013247","journal-title":"Eur J Oper Res"},{"key":"366_CR14","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/S0377-2217(97)00190-2","volume":"104","author":"E Carrizosa","year":"1998","unstructured":"Carrizosa E, Mu\u00f1oz-M\u00e1rquez M, Puerto J (1998) The Weber problem with regional demand. Eur J Oper Res 104:358\u2013365","journal-title":"Eur J Oper Res"},{"key":"366_CR15","volume-title":"Nonsmooth analysis and control theory","author":"FH Clarke","year":"1998","unstructured":"Clarke FH, Ledyaev YS, Stern J, Subbotin AI (1998) Nonsmooth analysis and control theory. Springer, New York"},{"key":"366_CR16","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/BF00939646","volume":"67","author":"PL Combettes","year":"1990","unstructured":"Combettes PL, Trussell HJ (1990) Method of successive projections for finding a common point of sets in metric space. J Optim Theory Appl 67:487\u2013507","journal-title":"J Optim Theory Appl"},{"key":"366_CR17","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1006005","volume":"6","author":"L Cooper","year":"1964","unstructured":"Cooper L (1964) Heuristic methods for location-allocation problems. SIAM Rev 6:37\u201353","journal-title":"SIAM Rev"},{"key":"366_CR18","volume-title":"Spatial analysis and location-allocation models","author":"A Ghosh","year":"1987","unstructured":"Ghosh A, Rushton G (1987) Spatial analysis and location-allocation models. Van Nostrand Reinhold, New York"},{"key":"366_CR19","volume-title":"Mathematical analysis: foundations and advanced techniques for functions of several variables","author":"M Giaquinta","year":"2011","unstructured":"Giaquinta M, Modica G (2011) Mathematical analysis: foundations and advanced techniques for functions of several variables. Birkh\u00e4user, Boston"},{"key":"366_CR20","first-page":"2049","volume":"6","author":"A Gunawardana","year":"2005","unstructured":"Gunawardana A, Byrne W (2005) Convergence theorems for generalized alternating minimization procedures. J Mach Learn Res 6:2049\u20132073","journal-title":"J Mach Learn Res"},{"key":"366_CR21","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1002\/1520-6750(199509)42:6<967::AID-NAV3220420608>3.0.CO;2-X","volume":"42","author":"HW Hamacher","year":"1995","unstructured":"Hamacher HW, Nickel S (1995) Restricted planar location problems and applications. Nav Res Logist 42:967\u2013992","journal-title":"Nav Res Logist"},{"key":"366_CR22","unstructured":"Hausdorff F (1949) Grundz\u00fcge der Mengenlehre (1914), reprinted by the Chelsea Publishing Company, New York"},{"key":"366_CR23","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.ejor.2007.02.043","volume":"187","author":"JL Jiang","year":"2008","unstructured":"Jiang JL, Yuan XM (2008) A heuristic algorithm for constrained multi-source Weber problem\u2014the variational inequality approach. Eur J Oper Res 187:357\u2013370","journal-title":"Eur J Oper Res"},{"key":"366_CR24","volume-title":"An introduction to variational inequalities and their application","author":"D Kinderlehrer","year":"1980","unstructured":"Kinderlehrer D, Stampacchia G (1980) An introduction to variational inequalities and their application. Academic Press, New York"},{"key":"366_CR25","volume-title":"Urban operations research","author":"RC Larson","year":"1981","unstructured":"Larson RC, Odoni AR (1981) Urban operations research. Prentice-Hall, Englewood Cliffs"},{"key":"366_CR26","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0305-0548(02)00191-0","volume":"31","author":"Y Levin","year":"2004","unstructured":"Levin Y, Ben-Israel A (2004) A heuristic method for large-scale multi-facility location problems. Comput Oper Res 31:257\u2013272","journal-title":"Comput Oper Res"},{"key":"366_CR27","volume-title":"Facilities location: models and methods","author":"RF Love","year":"1988","unstructured":"Love RF, Morris JG, Wesolowsky GO (1988) Facilities location: models and methods. North Holland, Amsterdam"},{"key":"366_CR28","first-page":"2932","volume":"218","author":"EA Pilotta","year":"2011","unstructured":"Pilotta EA, Torres GA (2011) A projected Weiszfeld algorithm for the box-constrained Weber location problem. Appl Math Comput 218:2932\u20132943","journal-title":"Appl Math Comput"},{"key":"366_CR29","first-page":"355","volume":"43","author":"E Weiszfeld","year":"1937","unstructured":"Weiszfeld E (1937) Sur le point lequel la somme des distances de n points donn\u00e9s est minimum. T\u00f4hoku Math J 43:355\u2013386","journal-title":"T\u00f4hoku Math J"},{"key":"366_CR30","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800180107","volume":"18","author":"GO Wesolowsky","year":"1971","unstructured":"Wesolowsky GO, Love RF (1971) Location of facilities with rectangular distances among point and area destinations. Nav Res Logist Q 18:83\u201390","journal-title":"Nav Res Logist Q"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-017-0366-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-017-0366-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-017-0366-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,19]],"date-time":"2018-12-19T17:19:16Z","timestamp":1545239956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-017-0366-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,2]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["366"],"URL":"https:\/\/doi.org\/10.1007\/s10288-017-0366-y","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,2]]}}}