{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:11:22Z","timestamp":1759666282708},"reference-count":25,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":7078,"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":[[1994,3]]},"DOI":"10.1016\/0166-218x(94)90218-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"357-378","source":"Crossref","is-referenced-by-count":31,"title":["A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem"],"prefix":"10.1016","volume":"49","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sridhar","family":"Ramachandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seong-in","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90218-6_BIB1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581249","article-title":"Mixed-integer bilinear programming","volume":"59","author":"Adams","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)90218-6_BIB2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0377-2217(85)90246-2","article-title":"Facility location models for distribution planning","volume":"22","author":"Aikens","year":"1985","journal-title":"European. J. Oper. Res."},{"key":"10.1016\/0166-218X(94)90218-6_BIB3","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/opre.11.3.331","article-title":"Location-allocation problems","volume":"11","author":"Cooper","year":"1963","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(94)90218-6_BIB4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1006005","article-title":"Heuristic methods for location-allocation problems","volume":"6","author":"Cooper","year":"1964","journal-title":"SIAM Rev."},{"key":"10.1016\/0166-218X(94)90218-6_BIB5","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.20.1.94","article-title":"The transportation location problem","volume":"20","author":"Cooper","year":"1972","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(94)90218-6_BIB6","series-title":"Facility Layout and Location: An Analytical Approach","author":"Francis","year":"1974"},{"key":"10.1016\/0166-218X(94)90218-6_BIB7","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/1009031","article-title":"Integer programming by implicit enumeration and Balas' method","volume":"7","author":"Geoffrion","year":"1967","journal-title":"SIAM Rev."},{"key":"10.1016\/0166-218X(94)90218-6_BIB8","first-page":"1","article-title":"Facility location algorithms","volume":"22","author":"Hansen","year":"1987"},{"key":"10.1016\/0166-218X(94)90218-6_BIB9","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1002\/nav.3800220304","article-title":"A computational procedure for the exact solution of location-allocation problems with rectangular distances","volume":"22","author":"Love","year":"1975","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(94)90218-6_BIB10","series-title":"Facility Layout and Location: An Analytical Approach","author":"Love","year":"1988"},{"key":"10.1016\/0166-218X(94)90218-6_BIB11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/nav.3800280213","article-title":"An efficient algorithm for the location-allocation problem with rectangular regions","volume":"28","author":"Maruchek","year":"1987","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(94)90218-6_BIB12","series-title":"Discrete Optimization","author":"Parker","year":"1988"},{"key":"10.1016\/0166-218X(94)90218-6_BIB13","series-title":"Ph.D. Dissertation","article-title":"Biconvex programming and deterministic and stochastic location allocation problems","author":"Selim","year":"1979"},{"key":"10.1016\/0166-218X(94)90218-6_BIB14","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1287\/opre.32.4.878","article-title":"A decomposition algorithm for a discrete location-allocation problem","volume":"32","author":"Sherali","year":"1984","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(94)90218-6_BIB15","series-title":"Working Paper","article-title":"A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems","author":"Sherali","year":"1989"},{"key":"10.1016\/0166-218X(94)90218-6_BIB16","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00122429","article-title":"A new reformulation-linearization technique for the bilinear programming problems","volume":"2","author":"Sherali","year":"1992","journal-title":"J. Global Optim."},{"key":"10.1016\/0166-218X(94)90218-6_BIB17","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1287\/moor.13.1.32","article-title":"NP-hard, capacitated, balanced p-median problems on a chain graph with a continuum of link demands","volume":"13","author":"Sherali","year":"1988","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(94)90218-6_BIB18","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1080\/05695557708975135","article-title":"The rectilinear distance location-allocation problem","volume":"9","author":"Sherali","year":"1977","journal-title":"AIIE Trans."},{"key":"10.1016\/0166-218X(94)90218-6_BIB19","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1002\/1520-6750(199206)39:4<447::AID-NAV3220390403>3.0.CO;2-O","article-title":"A squared Euclidean distance location-allocation problem","volume":"39","author":"Sherali","year":"1992","journal-title":"Naval Res. Logist."},{"key":"10.1016\/0166-218X(94)90218-6_BIB20","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01447654","article-title":"A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems","volume":"20","author":"Sherali","year":"1989","journal-title":"Appl. Math. Optim."},{"key":"10.1016\/0166-218X(94)90218-6_BIB21","first-page":"442","article-title":"Rectilinear distance location-allocation problem: A simplex based algorithm","volume":"174","author":"Shetty","year":"1980"},{"key":"10.1016\/0166-218X(94)90218-6_BIB22","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1002\/nav.3800230212","article-title":"The bilinear programming problem","volume":"23","author":"Vaish","year":"1976","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(94)90218-6_BIB23","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1287\/opre.21.1.314","article-title":"Location theory, dominance, and convexity","volume":"21","author":"Wendell","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(94)90218-6_BIB24","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01584989","article-title":"Exact and approximate solutions to the multisource Weber problem","volume":"3","author":"Kuenne","year":"1972","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)90218-6_BIB25","first-page":"443","article-title":"Properties and solution methods for large location-allocation problems","volume":"33","author":"Love","year":"1982","journal-title":"J. Oper. Res. Soc."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94902186?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94902186?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:26:45Z","timestamp":1555122405000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94902186"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":25,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0166218X94902186"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90218-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}