{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T13:33:46Z","timestamp":1697636026054},"reference-count":27,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s0167-6377(01)00062-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:29:03Z","timestamp":1027614543000},"page":"161-167","source":"Crossref","is-referenced-by-count":20,"title":["A family of facets for the uncapacitated p-median polytope"],"prefix":"10.1016","volume":"28","author":[{"suffix":"Jr.","given":"I.R","family":"de Farias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(01)00062-1_BIB1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01581103","article-title":"Capacitated facility location: separation algorithms and computational experience","volume":"81","author":"Aardal","year":"1998","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(01)00062-1_BIB2","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1287\/moor.20.3.562","article-title":"Capacitated facility location: valid inequalities and facets","volume":"20","author":"Aardal","year":"1995","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB3","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/PL00011405","article-title":"On the p-median polytope","volume":"89","author":"Avella","year":"2001","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(01)00062-1_BIB4","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","article-title":"A note on solving large p-median problems","volume":"21","author":"Beasley","year":"1985","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB5","unstructured":"J.E. Beasley, OR-library, http:\/\/mscmga.ms.ic.ac.uk\/info.html."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB6","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1287\/moor.8.4.579","article-title":"On the uncapacitated location problem I: valid inequalities and facets","volume":"8","author":"Cho","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB7","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1287\/moor.8.4.590","article-title":"On the uncapacitated location problem II: facets and lifting theorems","volume":"8","author":"Cho","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB8","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/0377-2217(82)90160-6","article-title":"A tree search algorithm for the p-median problem","volume":"10","author":"Christofides","year":"1982","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB9","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","article-title":"Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms","volume":"23","author":"Cornuejols","year":"1977","journal-title":"Manage. Sci."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0167-5060(08)70732-5","article-title":"On the uncapacitated location problem","volume":"1","author":"Cornuejols","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB11","series-title":"Discrete Location Theory","first-page":"1","article-title":"The uncapacitated facility location problem","author":"Cornuejols","year":"1990"},{"key":"10.1016\/S0167-6377(01)00062-1_BIB12","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF01583779","article-title":"Some facets of the simple plant location polytope","volume":"23","author":"Cornuejols","year":"1982","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(01)00062-1_BIB13","unstructured":"I.R. de Farias Jr., A polyhedral approach to combinatorial complementarity programming problems, Ph.D. Thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, 1995."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB14","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/BFb0120893","article-title":"Fractional vertices, cuts and facets of the simple plant location problem","volume":"12","author":"Guignard","year":"1980","journal-title":"Math. Programming Stud."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/(SICI)1097-0037(199708)30:1<31::AID-NET4>3.0.CO;2-M","article-title":"Locating replicas of a database on a network","volume":"30","author":"Hakimi","year":"1977","journal-title":"Networks"},{"key":"10.1016\/S0167-6377(01)00062-1_BIB16","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/opre.20.1.173","article-title":"A branch-and-bound algorithm for seeking the p-median","volume":"20","author":"J\u00e4rvinen","year":"1972","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB17","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","article-title":"An algorithmic approach to network location problems II: the p-medians","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB18","series-title":"Discrete Location Theory","first-page":"1","article-title":"Ingredients of locational analysis","author":"Krarup","year":"1990"},{"key":"10.1016\/S0167-6377(01)00062-1_BIB19","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF01587093","article-title":"Valid inequalities and facets of the capacitated plant location problem","volume":"44","author":"Leung","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(01)00062-1_BIB20","series-title":"Discrete Location Theory","first-page":"1","article-title":"The p-median problem and generalizations","author":"Mirchandani","year":"1990"},{"key":"10.1016\/S0167-6377(01)00062-1_BIB21","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1287\/opre.25.4.709","article-title":"An algorithm for the p-median problem","volume":"25","author":"Narula","year":"1977","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB22","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","article-title":"MINTO, a mixed-integer optimizer","volume":"15","author":"Nemhauser","year":"1994","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB23","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","article-title":"Valid linear inequalities for fixed charge problems","volume":"33","author":"Padberg","year":"1985","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB24","unstructured":"M.W.P. Savelsbergh, Functional description of MINTO, a mixed integer optimizer (version 3.0), http:\/\/udaloy.isye.gatech.edu\/ mwps\/projects\/minto.html."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB25","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1002\/(SICI)1520-6750(200003)47:2<166::AID-NAV6>3.0.CO;2-W","article-title":"Discrete equal-capacity p-median problem","volume":"47","author":"Sherali","year":"2000","journal-title":"Naval Res. Logist."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB26","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0167-6377(85)90012-4","article-title":"Valid inequalities and separation for uncapacitated fixed charge networks","volume":"4","author":"van Roy","year":"1985","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(01)00062-1_BIB27","unstructured":"R.T. Ward, P. Lemke, A. Oudjit, Properties of the k-median linear programming relaxation, Technical Report, Rensselaer Polytechnic Institute, Troy, NY, 1988."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000621?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000621?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T01:24:15Z","timestamp":1556241855000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637701000621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0167637701000621"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(01)00062-1","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}