{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T07:01:14Z","timestamp":1726470074376},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1016\/j.cor.2018.12.018","type":"journal-article","created":{"date-parts":[[2018,12,19]],"date-time":"2018-12-19T11:49:28Z","timestamp":1545220168000},"page":"174-190","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Adding incompatibilities to the Simple Plant Location Problem: Formulation, facets and computational experience"],"prefix":"10.1016","volume":"104","author":[{"given":"A.","family":"Mar\u00edn","sequence":"first","affiliation":[]},{"given":"M.","family":"Pelegr\u00edn","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2018.12.018_bib0001","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. Program."},{"issue":"9","key":"10.1016\/j.cor.2018.12.018_bib0002","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","article-title":"Algorithm 457: finding all cliques of an undirected graph","volume":"16","author":"Bron","year":"1973","journal-title":"Commun. ACM"},{"issue":"4","key":"10.1016\/j.cor.2018.12.018_bib0003","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0167-6377(00)00056-0","article-title":"New facets for the set packing polytope","volume":"27","author":"C\u00e1novas","year":"2000","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/j.cor.2018.12.018_bib0004","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1137\/S0895480100366786","article-title":"Facet obtaining procedures for set packing problems","volume":"16","author":"C\u00e1novas","year":"2002","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.cor.2018.12.018_bib0005","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0166-218X(01)00328-6","article-title":"On the facets of the simple plant location packing polytope","volume":"124","author":"C\u00e1novas","year":"2002","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.cor.2018.12.018_bib0006","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1287\/moor.8.4.579","article-title":"On the uncapacitated plant location problem I: valid inequalities and facets","volume":"8","author":"Cho","year":"1983","journal-title":"Math. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2018.12.018_bib0007","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1287\/moor.8.4.590","article-title":"On the uncapacitated plant location problem II: facets and lifting theorems","volume":"8","author":"Cho","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.cor.2018.12.018_bib0008","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","article-title":"Integer Programming","author":"Conforti","year":"2014"},{"key":"10.1016\/j.cor.2018.12.018_bib0009","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":"Cornu\u00e9jols","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.cor.2018.12.018_bib0010","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF01583779","article-title":"Some facets of the simple plant location polytope","volume":"23","author":"Cornu\u00e9jols","year":"1982","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2018.12.018_bib0011","unstructured":"Dias, E., Castonguay, D., Longo, H., Jradi, W., 2013. Efficient enumeration of chordless cycles. arXiv:1309.1051v1."},{"key":"10.1016\/j.cor.2018.12.018_bib0012","series-title":"Location Science","first-page":"47","article-title":"Fixed-charge facility location problems","author":"Fern\u00e1ndez","year":"2015"},{"key":"10.1016\/j.cor.2018.12.018_bib0013","unstructured":"Galli, L., Letchford, A., Miller, S., 2015. New valid inequalities and facets for the simple plant location problem. Work document."},{"key":"10.1016\/j.cor.2018.12.018_bib0014","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. Program."},{"key":"10.1016\/j.cor.2018.12.018_bib0015","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","article-title":"The simple plant location problem: survey and synthesis","volume":"12","author":"Krarup","year":"1983","journal-title":"Eur. J. Oper. Res."},{"year":"2001","series-title":"Obtenci\u00f3n de facetas de poliedros asociados a problemas de empaquetamiento","author":"Landete","key":"10.1016\/j.cor.2018.12.018_bib0016"},{"key":"10.1016\/j.cor.2018.12.018_sbref0015","series-title":"VI International Workshop on Location Analysis and Related Problems","first-page":"49","article-title":"Set-packing problems in discrete location","author":"Mar\u00edn","year":"2015"},{"key":"10.1016\/j.cor.2018.12.018_bib0018","doi-asserted-by":"crossref","DOI":"10.1007\/s11590-018-1312-4","article-title":"A new lifting theorem for vertex packing","author":"Mar\u00edn","year":"2018","journal-title":"Optim. Lett."},{"key":"10.1016\/j.cor.2018.12.018_bib0019","unstructured":"Max-planck institute, 2018. Max Planck Institute f\u00fcr Informatik (MPI-INF). http:\/\/resources.mpi-inf.mpg.de\/departments\/d1\/projects\/benchmarks\/UflLib\/index.html, Accessed: 2017-04-01."},{"key":"10.1016\/j.cor.2018.12.018_bib0020","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BF01580222","article-title":"Poperties of vertex packing and independence system polyhedra","volume":"6","author":"Nemhauser","year":"1974","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2018.12.018_bib0021","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","article-title":"On the facial structure of set packing polyhedra","volume":"5","author":"Padberg","year":"1973","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2018.12.018_bib0022","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1287\/opre.23.4.833","article-title":"A note on zero-one programming","volume":"23","author":"Padberg","year":"1975","journal-title":"Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2018.12.018_bib0023","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1287\/opre.44.6.864","article-title":"The plant location problem: new models and research prospects","volume":"44","author":"Revelle","year":"1996","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2018.12.018_bib0024","unstructured":"Sobolev institute, 2018. Sobolev Institute of Mathematics, laboratory Mathematical Models of Decision Making. http:\/\/www.math.nsc.ru\/AP\/benchmarks\/english.html, Accessed: 2017-04-01."},{"key":"10.1016\/j.cor.2018.12.018_bib0025","doi-asserted-by":"crossref","first-page":"631","DOI":"10.2307\/1235442","article-title":"A working model for plant numbers and locations","volume":"45","author":"Stollsteimer","year":"1963","journal-title":"J. Farm Econ."},{"issue":"4","key":"10.1016\/j.cor.2018.12.018_bib0026","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/1383369.1383382","article-title":"Fault-tolerant facility location","volume":"4","author":"Swamy","year":"2008","journal-title":"ACM Trans. Algorithms"},{"year":"1998","series-title":"Integer Programming","author":"Wolsey","key":"10.1016\/j.cor.2018.12.018_bib0027"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054818303307?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054818303307?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,23]],"date-time":"2019-01-23T14:38:58Z","timestamp":1548254338000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054818303307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":27,"alternative-id":["S0305054818303307"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2018.12.018","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2019,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Adding incompatibilities to the Simple Plant Location Problem: Formulation, facets and computational experience","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2018.12.018","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}