{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:46:45Z","timestamp":1751881605247},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1986,10,1]],"date-time":"1986-10-01T00:00:00Z","timestamp":528508800000},"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":[[1986,10]]},"DOI":"10.1007\/bf02591990","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T11:35:01Z","timestamp":1175168101000},"page":"72-80","source":"Crossref","is-referenced-by-count":17,"title":["A note on optimality conditions for the Euclidean. Multifacility location problem"],"prefix":"10.1007","volume":"36","author":[{"given":"Achiya","family":"Dax","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02591990_CR1","volume-title":"Finite Graphs and Networks","author":"R.G. Busacker","year":"1965","unstructured":"R.G. Busacker and T.L. Saaty,Finite Graphs and Networks (McGraw-Hill, New York, 1965)."},{"key":"BF02591990_CR2","series-title":"Technical Report CS85","volume-title":"Handling degeneracy in a nonlinearl 1 algorithm","author":"S. Busovaca","year":"1985","unstructured":"S. Busovaca, \u201cHandling degeneracy in a nonlinearl 1 algorithm,\u201d Technical Report CS85 34, University of Waterloo (Waterloo, Ontario, 1985)."},{"key":"BF02591990_CR3","volume-title":"On numerical methods for continuous location problems","author":"P.H. Calamai","year":"1983","unstructured":"P.H. Calamai, \u201cOn numerical methods for continuous location problems,\u201d Ph.D. Thesis, University of Waterloo (Waterloo, Ontario, 1983)."},{"key":"BF02591990_CR4","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1002\/nav.3800270408","volume":"27","author":"P.H. Calamai","year":"1980","unstructured":"P.H. Calamai and C. Charalambous, \u201cSolving multifacility location problems, involving Euclidean distances,\u201d Naval Research Logistics Quarterly 27 (1980) 609\u2013620.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02591990_CR5","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1137\/0901037","volume":"1","author":"P.H. Calamai","year":"1980","unstructured":"P.H. Calamai and A.R. Conn, \u201cA stable algorithm for solving the multifacility location problem involving Euclidean distances,\u201d SIAM Journal on Scientific and Statistical Computing 1 (1980) 512\u2013526.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"BF02591990_CR6","series-title":"Lecture Notes in Mathematics","first-page":"1","volume-title":"Numerical Analysis: Proceedings of the Ninth Biennial Conference, Dundee, Scotland","author":"P.H. Calamai","year":"1982","unstructured":"P.H. Calamai and A.R. Conn, \u201cA second-order method for solving the continuous multifacility location problem,\u201d in: G.A. Watson, ed.,Numerical Analysis: Proceedings of the Ninth Biennial Conference, Dundee, Scotland, Lecture Notes in Mathematics 912 (Springer-Verlag, Berlin, 1982), pp. 1\u201325."},{"key":"BF02591990_CR7","unstructured":"A. Dax, \u201cAn efficient algorithm for solving the rectilinear multifacility location problem\u201d submitted for publication in IMA Journal of Numerical Analysis (1984)."},{"key":"BF02591990_CR8","doi-asserted-by":"crossref","unstructured":"A. Dax, \u201cAn efficient clustering technique for solving the Euclidean multifacility location problem,\u201d in preparation (1986).","DOI":"10.1007\/BF02591990"},{"key":"BF02591990_CR9","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/BF02591963","volume":"27","author":"M.L. Overton","year":"1983","unstructured":"M.L. Overton, \u201cA quadratically convergent method for minimizing a sum of Euclidean norms,\u201d Mathematical Programming 27 (1983) 34\u201363.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591990.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591990\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591990","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:37:51Z","timestamp":1558381071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591990"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,10]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,10]]}},"alternative-id":["BF02591990"],"URL":"https:\/\/doi.org\/10.1007\/bf02591990","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,10]]}}}