{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:39:09Z","timestamp":1778819949637,"version":"3.51.4"},"reference-count":53,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/s0305-0548(96)00048-2","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:18:15Z","timestamp":1049501895000},"page":"127-140","source":"Crossref","is-referenced-by-count":27,"title":["Solving the anti-covering location problem using Lagrangian relaxation"],"prefix":"10.1016","volume":"24","author":[{"given":"Alan T.","family":"Murray","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard L.","family":"Church","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(96)00048-2_BIB1","series-title":"Computers and Intractability: A guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB2","series-title":"Modern Heuristic Techniques for Combinatorial Problems","article-title":"Lagrangean relaxation","author":"Beasley","year":"1993"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB3","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1287\/mnsc.30.3.290","article-title":"An analysis of network location problems with distance constraints","volume":"30","author":"Moon","year":"1984","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB4","article-title":"Using proximity restrictions for locating undesirable facilities","author":"Murray","year":"1996","journal-title":"Studies in Locational Analysis"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB5","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB6","unstructured":"Pardalos, P. and Xue, J., The maximal clique problem. Journal of Global Optimization, In press."},{"key":"10.1016\/S0305-0548(96)00048-2_BIB7","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1090\/S0002-9904-1962-10791-5","article-title":"Covers and packings in a family of sets","volume":"68","author":"Edmonds","year":"1962","journal-title":"Bulletin of the American Mathematical Society"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1137\/0220012","article-title":"Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs","volume":"20","author":"Balas","year":"1991","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB9","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","article-title":"Finding a maximum clique in an arbitrary graph","volume":"15","author":"Balas","year":"1986","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB10","series-title":"Graph Theory: An Algorithmic Approach","author":"Christofides","year":"1975"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB11","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0305-0483(86)90079-4","article-title":"Locating independent facilities with maximum weight: greedy heuristics","volume":"14","author":"Chaudhry","year":"1986","journal-title":"Omega"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB12","series-title":"Algorithm Theory-SWAT'92","first-page":"326","article-title":"Determining DNA sequence similarity using maximal independent set algorithms for interval graphs","author":"Joseph","year":"1992"},{"issue":"1","key":"10.1016\/S0305-0548(96)00048-2_BIB13","doi-asserted-by":"crossref","first-page":"S14","DOI":"10.1287\/opre.40.1.S14","article-title":"Habitat dispersion in forest planning and the stable set problem","volume":"40","author":"Barahona","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB14","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1093\/forestscience\/40.1.142","article-title":"A column generation algorithm for solving general forest planning problems with adjacency constraints","volume":"40","author":"Weintraub","year":"1994","journal-title":"Forest Science"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB15","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1111\/j.1538-4632.1987.tb00133.x","article-title":"Programming models for facility dispersion: the p-dispersion and maximum dispersion problems","volume":"19","author":"Kuby","year":"1987","journal-title":"Geographical Analysis"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB16","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0377-2217(90)90297-O","article-title":"The discrete p-dispersion problem","volume":"46","author":"Erkut","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1068\/b150181","article-title":"A multimedian problem with interdistance constraints","volume":"15","author":"Erkut","year":"1988","journal-title":"Environment and Planning B"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB18","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1057\/jors.1991.134","article-title":"Minimax location of two facilities with minimum separation: interactive graphical solutions","volume":"42","author":"Moon","year":"1991","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB19","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0305-0548(91)90040-X","article-title":"The maximal dispersion problem and the \u201cfirst point outside the neighborhood\u201d heuristic","volume":"18","author":"White","year":"1991","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB20","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1057\/jors.1993.173","article-title":"Location of two facilities with minimal separation","volume":"44","author":"White","year":"1993","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB21","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1287\/opre.42.2.299","article-title":"Heuristic and special case algorithms for dispersion problems","volume":"42","author":"Ravi","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB22","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1002\/net.3230190307","article-title":"The maximal independent set problem for cubic planar graphs","volume":"19","author":"Burns","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB23","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/BF01994845","article-title":"The weighted maximal independent set problem in permutation graphs","volume":"32","author":"Yu","year":"1992","journal-title":"BIT"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB24","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1002\/jgt.3190170407","article-title":"Maximal independent sets in bipartite graphs","volume":"17","author":"Liu","year":"1993","journal-title":"Journal of Graph Theory"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB25","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1057\/jors.1992.71","article-title":"A strong cutting plane\/branch and bound algorithm for node packing","volume":"43","author":"Nemhauser","year":"1992","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB26","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0377-2217(92)90246-6","article-title":"A neural design for the solution of the maximal independent set problem","volume":"62","author":"Burke","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB27","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02023002","article-title":"Solving the maximum clique problem using a tabu search approach","volume":"41","author":"Gendreau","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB28","series-title":"TIMS\/ORSA","article-title":"Parallel processing, martingales, and simulated annealing: and information theoretic approach to optimization","author":"Fleischer","year":"1994"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB29","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling-salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB30","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling-salesman problem and minimum spanning trees: Part II","volume":"1","author":"Held","year":"1971","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangean relaxation method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB32","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","article-title":"Location of bank accounts to optimize float: an analytical study of exact and approximate algorithms","volume":"23","author":"Cornuejols","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB33","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":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB34","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(85)90012-8","article-title":"A comparison of two dual-based procedures for solving the p-median problem","volume":"20","author":"Hanjoul","year":"1985","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB35","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/inte.15.2.10","article-title":"An applications oriented guide to Lagrangean relaxation","volume":"15","author":"Fisher","year":"1985","journal-title":"Interfaces"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB36","series-title":"Model building in mathematical programming","author":"Williams","year":"1990"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB37","article-title":"Modeling adjacency conditions in spatial optimization problems","author":"Murray","year":"1995"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB38","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BFb0120693","article-title":"Experiments in the formulation of integer programming problems","volume":"2","author":"Williams","year":"1974","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB39","article-title":"Constructing and selecting adjacency constraints","volume":"34","author":"Murray","year":"1996","journal-title":"INFOR"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB40","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB41","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","article-title":"A lagrangian heuristic for set-covering problems","volume":"37","author":"Beasley","year":"1990","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB42","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0305-0548(94)90064-7","article-title":"Analyzing tradeoffs between zonal constraints and accessibility in facility location","volume":"21","author":"Gerrard","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB43","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01584346","article-title":"On convergence rates of subgradient optimization methods","volume":"13","author":"Goffin","year":"1977","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB44","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":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB45","series-title":"U.S. Forest Service Rocky Mountain Forest and Range Experiment Station General Technical Report RM-161","first-page":"46","article-title":"An algorithm for writing adjacency constraints efficiently in linear programming models","author":"Meneghin","year":"1988"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB46","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1093\/forestscience\/37.5.1283","article-title":"Formulating adjacency constraints in linear optimization models for scheduling projects in tactical planning","volume":"37","author":"Jones","year":"1991","journal-title":"Forest Science"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB47","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","article-title":"Set partitioning: a survey","volume":"18","author":"Balas","year":"1976","journal-title":"SIAM Review"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB48","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01580870","article-title":"Facets of the clique partitioning polytope","volume":"47","author":"Grotschel","year":"1990","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB49","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02618466","article-title":"Clustering and clique partitioning: simulated annealing and Tabu search approaches","volume":"9","author":"De Amorim","year":"1992","journal-title":"Journal of Classification"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB50","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1287\/opre.19.6.1363","article-title":"The location of emergency service facilities","volume":"19","author":"Toregas","year":"1971","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB51","article-title":"A decomposition algorithm for a class of facility location problems","author":"Swain","year":"1971"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB52","article-title":"An analysis of the coffee cooperative marketing system in Busoga, Uganda: transportation and facilities location","author":"Migereko","year":"1983"},{"key":"10.1016\/S0305-0548(96)00048-2_BIB53","article-title":"Methodology for servicing the geography of urban fire: an exploration with reference to London, Ontario","author":"Waters","year":"1977"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000482?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000482?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T20:05:31Z","timestamp":1733256331000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054896000482"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0305054896000482"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00048-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}