{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:26:20Z","timestamp":1759667180420},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,8,22]],"date-time":"2012-08-22T00:00:00Z","timestamp":1345593600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s11590-012-0538-9","type":"journal-article","created":{"date-parts":[[2012,8,21]],"date-time":"2012-08-21T06:33:10Z","timestamp":1345530790000},"page":"407-424","source":"Crossref","is-referenced-by-count":5,"title":["On the Weber facility location problem with limited distances and side constraints"],"prefix":"10.1007","volume":"8","author":[{"given":"Isaac F.","family":"Fernandes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Aloise","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario J.","family":"Aloise","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,22]]},"reference":[{"key":"538_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10107-010-0349-7","volume":"131","author":"D. Aloise","year":"2012","unstructured":"Aloise D., Hansen P., Liberti L.: An improved column generation algorithm for minimum sum-of-squares clustering. Math. Program. 131, 195\u2013220 (2012)","journal-title":"Math. Program."},{"key":"538_CR2","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P. Belotti","year":"2009","unstructured":"Belotti P., Lee J., Liberti L., Margot F., W\u00e4chter A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24, 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"538_CR3","doi-asserted-by":"crossref","first-page":"1675","DOI":"10.1016\/j.cor.2009.11.003","volume":"37","author":"O. Berman","year":"2010","unstructured":"Berman O., Drezner Z., Krass D.: Generalized coverage: new developments in covering location models. Comput. Oper. Res. 37, 1675\u20131687 (2010)","journal-title":"Comput. Oper. Res."},{"key":"538_CR4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0167-6377(98)00016-9","volume":"22","author":"J. Brimberg","year":"1998","unstructured":"Brimberg J., Chen R., Chen D.: Accelerating convergence in the Fermat\u2013Weber location problem. Oper. Res. Lett. 22, 151\u2013157 (1998)","journal-title":"Oper. Res. Lett."},{"key":"538_CR5","unstructured":"Bonami, P., Lee J.: BONMIN user\u2019s manual. Technical report, IBM Corporation (2007)"},{"key":"538_CR6","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P. Bonami","year":"2008","unstructured":"Bonami P., Biegler L., Conn A.R., Cornu\u00e9jols G., Grossmann I.E., Laird C.D., Lee J., Lodi A., Margot F., Sawaya N., W\u00e4chter A.: An algorithmic framework for convex mixed integer nonlinear programs. Discret. Optim. 5, 186\u2013204 (2008)","journal-title":"Discret. Optim."},{"key":"538_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd S., Vandenberghe L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"538_CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01942293","volume":"32","author":"R. Church","year":"1974","unstructured":"Church R., ReVelle C.: The maximal covering location problem. Pap. Reg. Sci. Assoc. 32, 101\u2013118 (1974)","journal-title":"Pap. Reg. Sci. Assoc."},{"key":"538_CR9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01939922","volume":"53","author":"R. Church","year":"1983","unstructured":"Church R., Roberts K.L.: Generalized coverage models and public facility location. Pap. Reg. Sci. Assoc. 53, 117\u2013135 (1983)","journal-title":"Pap. Reg. Sci. Assoc."},{"key":"538_CR10","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/99.714603","volume":"5","author":"J. Czyzyk","year":"1998","unstructured":"Czyzyk J., Mesnier M., Mor\u00e9 J.: The NEOS Server. IEEE J. Comput. Sci. Eng. 5, 68\u201375 (1998)","journal-title":"IEEE J. Comput. Sci. Eng."},{"key":"538_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"1997","unstructured":"Berg M., Krefeld M., Overmars M., Schwarzkopf O.: Computational Geometry: Algorithms and Applications. Springer, Berlin (1997)"},{"key":"538_CR12","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1080\/05695558008974513","volume":"12","author":"Z. Drezner","year":"1980","unstructured":"Drezner Z., Wesolowsky G.O.: A maximin location problem with maximum distance constraints. AIIE Transact. 12, 249\u2013252 (1980)","journal-title":"AIIE Transact."},{"key":"538_CR13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1287\/trsc.25.3.183","volume":"25","author":"Z. Drezner","year":"1991","unstructured":"Drezner Z., Mehrez A., Wesolowsky G.O.: The facility location problem with limited distances. Transp. Sci. 25, 183\u2013187 (1991)","journal-title":"Transp. Sci."},{"key":"538_CR14","volume-title":"Facility Location: Applications and Theory","author":"Z. Drezner","year":"2004","unstructured":"Drezner Z., Hamacher H.W.: Facility Location: Applications and Theory. Springer, Berlin (2004)"},{"key":"538_CR15","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1002\/nav.20030","volume":"51","author":"Z. Drezner","year":"2004","unstructured":"Drezner Z., Wesolowsky G.O., Drezner T.: The gradual covering problem. Nav. Res. Logist. 51, 841\u2013855 (2004)","journal-title":"Nav. Res. Logist."},{"key":"538_CR16","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/opre.1040.0137","volume":"53","author":"S.P. Fekete","year":"2005","unstructured":"Fekete S.P., Mitchell J.S.B., Beurer K.: On the continuous Fermat\u2013Weber problem. Oper. Res. 53, 61\u201376 (2005)","journal-title":"Oper. Res."},{"key":"538_CR17","unstructured":"Gurgel A.M.: Melhoria da seguran\u00e7a p\u00fablica: Uma proposta para a aloca\u00e7\u00e3o de unidades policiais utilizando o modelo das p-medianas e do caixeiro viajante. M.Sc. dissertation. Universidade Federal do Rio Grande do Norte (2010)"},{"key":"538_CR18","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0167-6377(98)00004-2","volume":"22","author":"P. Hansen","year":"1998","unstructured":"Hansen P., Mladenovi\u0107 N., Mladenovi\u0107 N.: Heuristic solution of the multisource Weber problem as a image-median problem\u201d. Oper. Res. Lett. 22, 55\u201362 (1998)","journal-title":"Oper. Res. Lett."},{"key":"538_CR19","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/0-387-30528-9_8","volume-title":"Global Optimization: from Theory to Implementation","author":"L. Liberti","year":"2006","unstructured":"Liberti L.: Writing global optimization software. In: Liberti, L., Maculan, N. (eds.) Global Optimization: from Theory to Implementation, pp. 211\u2013262. Springer, Berlin (2006)"},{"key":"538_CR20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1051\/ro\/2009005","volume":"43","author":"L. Liberti","year":"2009","unstructured":"Liberti L.: Reformulations in mathematical programming: definitions and systematics. RAIRO-RO 43, 55\u201386 (2009)","journal-title":"RAIRO-RO"},{"key":"538_CR21","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/mnsc.37.2.233","volume":"37","author":"H. Pirkul","year":"1991","unstructured":"Pirkul H., Schilling D.A.: The maximal covering location problem with capacities on total workload. Manag. Sci. 37, 233\u2013248 (1991)","journal-title":"Manag. Sci."},{"key":"538_CR22","first-page":"25","volume":"1","author":"D.A. Schilling","year":"1993","unstructured":"Schilling D.A., Jayaraman V., Barkhi R.: A review of covering problems in facility location. Locat. Sci. 1, 25\u201355 (1993)","journal-title":"Locat. Sci."},{"key":"538_CR23","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0098-1354(98)00286-5","volume":"23","author":"E. Smith","year":"1999","unstructured":"Smith E., Pantelides C.: A symbolic reformulation\/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 23, 457\u2013478 (1999)","journal-title":"Comput. Chem. Eng."},{"key":"538_CR24","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1057\/jors.2008.172","volume":"60","author":"H.K. Smith","year":"2009","unstructured":"Smith H.K., Laporte G., Harper P.R.: Locational analysis: highlights of growth to maturity. J. Oper. Res. Soc. 60, 140\u2013148 (2009)","journal-title":"J. Oper. Res. Soc."},{"key":"538_CR25","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M. Tawarmalani","year":"2005","unstructured":"Tawarmalani M., Sahinidis N.V.: A polyhedral branch-and-cut approach to global optimization. Mathe. Program. 103, 225\u2013249 (2005)","journal-title":"Mathe. Program."},{"key":"538_CR26","first-page":"5","volume":"1","author":"G.O. Wesolowsky","year":"1993","unstructured":"Wesolowsky G.O.: The Weber problem: history and perspectives. Locat. Sci. 1, 5\u201323 (1993)","journal-title":"Locat. Sci."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0538-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0538-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0538-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:33Z","timestamp":1559394693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0538-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,22]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["538"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0538-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,22]]}}}