{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T07:03:00Z","timestamp":1783666980457,"version":"3.55.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,9,29]],"date-time":"2006-09-29T00:00:00Z","timestamp":1159488000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2007,11,29]]},"DOI":"10.1007\/s10288-006-0023-3","type":"journal-article","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T06:57:22Z","timestamp":1159426642000},"page":"299-314","source":"Crossref","is-referenced-by-count":30,"title":["A branch-and-cut method for the obnoxious p-median problem"],"prefix":"10.1007","volume":"5","author":[{"given":"Pietro","family":"Belotti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martine","family":"Labb\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesco","family":"Maffioli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Malick M.","family":"Ndiaye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,9,29]]},"reference":[{"issue":"1\u20134","key":"23_CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/A:1026130003508","volume":"122","author":"O Alp","year":"2003","unstructured":"Alp O, Drezner Z, Erkut E (2003) An efficient genetic algorithm for the p-median problem. Ann Oper Res 122(1\u20134):21\u201342","journal-title":"Ann Oper Res"},{"issue":"11","key":"23_CR2","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069\u20131072","journal-title":"J Oper Res Soc"},{"key":"23_CR3","unstructured":"Belotti P, Labb\u00e9 M, Maffioli F (2000) A Tabu Search approach to the Obnoxious p-Median problem. Internal report 2000.49, DEI, Politecnico di Milano"},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0166-218X(00)00177-3","volume":"105","author":"RE Burkard","year":"2000","unstructured":"Burkard RE, \u00c7ela E, Dollani H (2000) 2-Medians in Networks with Pos\/Neg Weights. Discrete Appl Math 105:51\u201371","journal-title":"Discrete Appl Math"},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(03)00431-1","volume":"133","author":"P Cappanera","year":"1999","unstructured":"Cappanera P, Gallo G, Maffioli F (1999) Discrete Facility Location and Routing of Obnoxious Activities. Discrete Appl Math 133:3\u201328","journal-title":"Discrete Appl Math"},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0377-2217(01)00030-3","volume":"136","author":"E Carrizosa","year":"2002","unstructured":"Carrizosa E, Conde E (2002) A fractional model for locating semi-desirable facilities on networks. Eur J Oper Res 136:67\u201380","journal-title":"Eur J Oper Res"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1287\/trsc.12.2.107","volume":"12","author":"RL Church","year":"1978","unstructured":"Church RL, Garfinkel RS (1978) Locating an obnoxious facility on a network. Transp Sci 12:107\u2013118","journal-title":"Transp Sci"},{"issue":"2","key":"23_CR8","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1023\/A:1009647225748","volume":"5","author":"M Dell\u2019Amico","year":"1999","unstructured":"Dell\u2019Amico M, Lodi A, Maffioli F (1999) Solution of the cumulative assignment problem with a well-structured Tabu search method. J Heuristics 5(2):123\u2013143","journal-title":"J Heuristics"},{"key":"23_CR9","volume-title":"Facility location: applications and theory","year":"2002","unstructured":"Drezner Z, Hamacher H (eds) (2002) Facility location: applications and theory. Springer, Berlin Heidelberg New York"},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/978-1-4612-5355-6_9","volume-title":"Facility locations: a survey of applications and methods.","author":"HA Eiselt","year":"1995","unstructured":"Eiselt HA, Laporte G (1995) Objectives in location problems. In: Drezner Z (ed) Facility locations: a survey of applications and methods. Springer Series in OR, New York, pp 151\u2013180"},{"key":"23_CR11","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0377-2217(90)90297-O","volume":"46","author":"E Erkut","year":"1990","unstructured":"Erkut E (1990) The discrete p-dispersion problem. Eur J Oper Res 46:48\u201360","journal-title":"Eur J Oper Res"},{"issue":"1","key":"23_CR12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0305-0548(90)90027-5","volume":"17","author":"E Erkut","year":"1990","unstructured":"Erkut E, Baptie T, Von Hohenbalken B (1990) The discrete p-maxian location problem. Comput Oper Res 17(1):51\u201361","journal-title":"Comput Oper Res"},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0377-2217(89)90420-7","volume":"40","author":"E Erkut","year":"1989","unstructured":"Erkut E, Neuman S (1989) Analytical models for locating undesirable facilities. Eur J Oper Res 40:275\u2013291","journal-title":"Eur J Oper Res"},{"key":"23_CR14","first-page":"68","volume":"29","author":"E Erkut","year":"1990","unstructured":"Erkut E, Neuman S (1990) Comparison of four models for dispersing facilities. INFOR 29:68\u201385","journal-title":"INFOR"},{"key":"23_CR15","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0377-2217(94)00159-6","volume":"88","author":"RD Galv\u00e3o","year":"1996","unstructured":"Galv\u00e3o RD, ReVelle C (1996) Lagrangean heuristic for the maximal covering location problem. Eur J Oper Res 88:114\u2013123","journal-title":"Eur J Oper Res"},{"key":"23_CR16","unstructured":"Hansen P, Moon ID (1988) Dispersing facilities on a Network. TIMS\/ORSA Joint National Meeting, Washington DC"},{"key":"23_CR17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/trsc.28.1.77","volume":"28","author":"CM Klein","year":"1994","unstructured":"Klein CM, Kincaid RK (1994) The discrete anti-p-center problem. Transp Sci 28:77\u201379","journal-title":"Transp Sci"},{"key":"23_CR18","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0377-2217(89)90189-6","volume":"39","author":"M Koerkel","year":"1989","unstructured":"Koerkel M (1989) On the exact solution of large-scale simple plant location problems. Eur J Oper Res 39:157\u2013173","journal-title":"Eur J Oper Res"},{"key":"23_CR19","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1111\/j.1538-4632.1987.tb00133.x","volume":"9","author":"MJ Kuby","year":"1987","unstructured":"Kuby MJ (1987) Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems. Geogr Anal 9:315\u2013329","journal-title":"Geogr Anal"},{"key":"23_CR20","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/net.3230130304","volume":"13","author":"E Minieka","year":"1983","unstructured":"Minieka E (1983) Anticenters and antimedians of a network. Networks 13:359\u2013364","journal-title":"Networks"},{"key":"23_CR21","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1287\/mnsc.30.3.290","volume":"30","author":"ID Moon","year":"1983","unstructured":"Moon ID, Chaudhry SS (1983) An analysis of network location problems with distance constraints. Manage Sci 30:290\u2013307","journal-title":"Manage Sci"},{"key":"23_CR22","unstructured":"Naddef D, Rinaldi G (2000) Branch-and-cut algorithms. In: Toth P, Vigo D (eds) Vehicle routing, SIAM"},{"issue":"3","key":"23_CR23","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/trsc.11.3.243","volume":"11","author":"DR Shier","year":"1977","unstructured":"Shier DR (1977) A min\u2013max theorem for p-center problems on a tree. Transp Sci 11(3):243\u2013252","journal-title":"Transp Sci"},{"key":"23_CR24","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1137\/0404048","volume":"4","author":"A Tamir","year":"1991","unstructured":"Tamir A (1991) Obnoxious facility location on graphs. SIAM J Discrete Math 4:550\u2013567","journal-title":"SIAM J Discrete Math"},{"key":"23_CR25","unstructured":"Ting SS (1988) Obnoxious facility location problems on networks, PhD thesis, The Johns Hopkins University"},{"key":"23_CR26","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0377-2217(97)00111-2","volume":"102","author":"SB Welch","year":"1997","unstructured":"Welch SB, Salhi S (1997) The obnoxious p-facility network location problem with facility interaction. Eur J Oper Res 102:302\u2013319","journal-title":"Eur J Oper Res"},{"key":"23_CR27","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1023\/A:1011293604251","volume":"19","author":"FG Zhang","year":"2001","unstructured":"Zhang FG, Melachrinoudis E (2001) The maximin-maxisum network location problem. Comput Optim Appl 19:209\u2013234","journal-title":"Comput Optim Appl"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0023-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-006-0023-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0023-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T18:27:06Z","timestamp":1707244026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-006-0023-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,29]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,11,29]]}},"alternative-id":["23"],"URL":"https:\/\/doi.org\/10.1007\/s10288-006-0023-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9,29]]}}}