{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:39:01Z","timestamp":1774946341010,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T00:00:00Z","timestamp":1726012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,9,11]]},"DOI":"10.1145\/3688671.3688764","type":"proceedings-article","created":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T13:06:21Z","timestamp":1735304781000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Heuristic Constraint Programming Approach to the p-median Problem with Distance Constraints"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-4589-3346","authenticated-orcid":false,"given":"Panteleimon","family":"Iosif","sequence":"first","affiliation":[{"name":"University of Western Macedonia, Kozani, GR"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5876-9945","authenticated-orcid":false,"given":"Nikolaos","family":"Ploskas","sequence":"additional","affiliation":[{"name":"University of Western Macedonia, Kozani, GR"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5702-9096","authenticated-orcid":false,"given":"Kostas","family":"Stergiou","sequence":"additional","affiliation":[{"name":"University of Western Macedonia, Kozani, GR"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,12,27]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"crossref","unstructured":"Michel Balinski. 1965. Integer programming: methods uses computations. Management Science 12 3 (1965) 253\u2013313.","DOI":"10.1287\/mnsc.12.3.253"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"crossref","unstructured":"John\u00a0E Beasley. 1985. A note on solving large p-median problems. European Journal of Operational Research 21 2 (1985) 270\u2013273.","DOI":"10.1016\/0377-2217(85)90040-2"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"crossref","unstructured":"Cesar Beltran Claude Tadonki and J\u00a0Ph Vial. 2006. Solving the p-median problem with a semi-Lagrangian relaxation. Computational Optimization and Applications 35 2 (2006) 239\u2013260.","DOI":"10.1007\/s10589-006-6513-6"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"crossref","unstructured":"Oded Berman and Rongbing Huang. 2008. The minimum weighted covering location problem with distance constraints. Computers and Operations Research 35 12 (2008) 356\u2013372.","DOI":"10.1016\/j.cor.2006.03.003"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.5555\/3000001.3000033"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29828-8_7"},{"key":"e_1_3_3_2_8_2","unstructured":"Emilio Carrizosa and Frank Plastria. 1999. Location of semi-obnoxious facilities. Studies in Locational Analysis 12 1999 (1999) 1\u201327."},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"crossref","unstructured":"Sohail\u00a0S Chaudhry S\u00a0Thomas McCormick and I\u00a0Douglas Moon. 1986. Locating independent facilities with maximum weight: Greedy heuristics. International Journal of Management Science 14 5 (1986) 383\u2013389.","DOI":"10.1016\/0305-0483(86)90079-4"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"crossref","unstructured":"Richard\u00a0L Church. 2003. COBRA: a new formulation of the classic p-median location problem. Annals of Operations Research 122 (2003) 103\u2013120.","DOI":"10.1023\/A:1026142406234"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"crossref","unstructured":"Richard\u00a0L Church and Michael\u00a0E Meadows. 1977. Results of a new approach to solving the p-median problem with maximum distance constraints. Geographical Analysis 9 4 (1977) 364\u2013378.","DOI":"10.1111\/j.1538-4632.1977.tb00589.x"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"crossref","unstructured":"Vasek Chvatal. 1979. A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4 3 (1979) 233\u2013235.","DOI":"10.1287\/moor.4.3.233"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"crossref","unstructured":"Warwick\u00a0J Comley. 1995. The location of ambivalent facilities: Use of a quadratic zero-one programming algorithm. Applied Mathematical Modeling 19 1 (1995) 26\u201329.","DOI":"10.1016\/0307-904X(94)00004-P"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"crossref","unstructured":"Gerard Cornuejols George\u00a0L Nemhauser and Laurence\u00a0A Wolsey. 1980. A canonical representation of simple plant location problems and its applications. SIAM Journal on Algebraic Discrete Methods 1 3 (1980) 261\u2013272.","DOI":"10.1137\/0601030"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"crossref","unstructured":"Paul\u00a0J Densham and Gerard Rushton. 1992. Strategies for solving large location-allocation problems by heuristic methods. Environment and Planning A 24 2 (1992) 289\u2013304.","DOI":"10.1068\/a240289"},{"key":"e_1_3_3_2_16_2","unstructured":"OR-Tools development team. [n. d.]. OR-Tools CP-SAT solver. https:\/\/developers.google.com\/optimization\/cp\/cp\\(\\_\\)solver."},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"crossref","unstructured":"Tammy Drezner Zvi Drezner and Anita Sch\u00f6bel. 2018. The Weber obnoxious facility location model: A big arc small arc approach. Computers and Operations Research 98 (2018) 240\u2013250.","DOI":"10.1016\/j.cor.2018.06.006"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"crossref","unstructured":"Zvi Drezner Pawel Kalczynski and Said Salhi. 2019. The planar multiple obnoxious facilities location problem: A Voronoi based heuristic. Omega 87 (2019) 105\u2013116.","DOI":"10.1016\/j.omega.2018.08.013"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04244-7_28"},{"key":"e_1_3_3_2_20_2","volume-title":"Proceedings of the 18th workshop on Constraint Modelling and Reformulation at CP (Modref 2019)","volume":"19","author":"Guns Tias","year":"2019","unstructured":"Tias Guns. 2019. Increasing modeling language convenience with a universal n-dimensional array, CPpy as python-embedded example. In Proceedings of the 18th workshop on Constraint Modelling and Reformulation at CP (Modref 2019), Vol.\u00a019."},{"key":"e_1_3_3_2_21_2","unstructured":"Gurobi Optimization LLC. 2023. Gurobi Optimizer Reference Manual. https:\/\/www.gurobi.com"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Louis Hakimi. 1964. Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research 12 3 (1964) 450\u2013459.","DOI":"10.1287\/opre.12.3.450"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"crossref","unstructured":"Louis Hakimi. 1965. Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Operations Research 13 3 (1965) 462\u2013475.","DOI":"10.1287\/opre.13.3.462"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"crossref","unstructured":"Basheer\u00a0M Khumawala. 1973. An efficient algorithm for the p-median problem with maximum distance constraints. Geographical Analysis 5 4 (1973) 309\u2013321.","DOI":"10.1111\/j.1538-4632.1973.tb00493.x"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"crossref","unstructured":"Jakob Krarup David Pisinger and Frank Plastria. 2002. Discrete location problems with push-pull objectives. Discrete Applied Mathematics 123 1-3 (2002) 363\u2013378.","DOI":"10.1016\/S0166-218X(01)00346-8"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"crossref","unstructured":"Alfred\u00a0A Kuehn and Michael\u00a0J Hamburger. 1963. A heuristic program for locating warehouses. Management Science 9 (1963) 643\u2013666.","DOI":"10.1287\/mnsc.9.4.643"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"crossref","unstructured":"Alan\u00a0K Mackworth. 1977. Consistency in networks of relations. Artificial intelligence 8 1 (1977) 99\u2013118.","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"crossref","unstructured":"Andrea Maier and Horst\u00a0W Hamacher. 2019. Complexity results on planar multifacility location problems with forbidden regions. Mathematical Methods of Operations Research 89 (2019) 433\u2013484.","DOI":"10.1007\/s00186-019-00670-0"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"crossref","unstructured":"Nenad Mladenovi\u0107 Jack Brimberg Pierre Hansen and Jos\u00e9\u00a0A Moreno-P\u00e9rez. 2007. The p-median problem: A survey of metaheuristic approaches. European Journal of Operational Research 179 3 (2007) 927\u2013939.","DOI":"10.1016\/j.ejor.2005.05.034"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"crossref","unstructured":"Nenad Mladenovi\u0107 Martine Labb\u00e9 and Pierre Hansen. 2003. Solving the p-center problem with tabu search and variable neighborhood search. Networks: An International Journal 42 1 (2003) 48\u201364.","DOI":"10.1002\/net.10081"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"crossref","unstructured":"Douglas\u00a0I Moon and Sohail\u00a0S Chaudhry. 1984. An analysis of network location problems with distance constraints. Management Science 30 3 (1984) 290\u2013307.","DOI":"10.1287\/mnsc.30.3.290"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"crossref","unstructured":"I\u00a0Douglas Moon and Lee Papayanopoulos. 1991. Minimax location of two facilities with minimum separation: Interactive graphical solutions. Journal of the Operations Research Society 42 (1991) 685\u2013694.","DOI":"10.1038\/sj\/jors\/0420807"},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"crossref","unstructured":"Pilar\u00a0Mart\u00ednez Ortigosa Eligius\u00a0MT Hendrix and Juana\u00a0L\u00f3pez Redondo. 2015. On heuristic bi-criterion methods for semi-obnoxious facility location. Computational Optimization and Applications 61 (2015) 205\u2013217.","DOI":"10.1007\/s10589-014-9709-1"},{"key":"e_1_3_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CP.2023.30"},{"key":"e_1_3_3_2_35_2","doi-asserted-by":"crossref","unstructured":"Wayne Pullan. 2008. A memetic genetic algorithm for the vertex p-center problem. Evolutionary computation 16 3 (2008) 417\u2013436.","DOI":"10.1162\/evco.2008.16.3.417"},{"key":"e_1_3_3_2_36_2","doi-asserted-by":"crossref","unstructured":"Charles\u00a0S ReVelle and Ralph\u00a0W Swain. 1970. Central facilities location. Geographical analysis 2 1 (1970) 30\u201342.","DOI":"10.1111\/j.1538-4632.1970.tb00142.x"},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"crossref","unstructured":"Kenneth\u00a0E Rosing CS ReVelle and H Rosing-Vogelaar. 1979. The p-median and its linear programming relaxation: An approach to large problems. Journal of the Operational Research Society 30 9 (1979) 815\u2013823.","DOI":"10.1057\/jors.1979.192"},{"key":"e_1_3_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58601-6_86"},{"key":"e_1_3_3_2_39_2","doi-asserted-by":"crossref","unstructured":"Sami Yamani\u00a0Douzi Sorkhabi David\u00a0A Romero J\u00a0Christopher Beck and Cristina\u00a0H Amon. 2018. Constrained multi-objective wind farm layout optimization: Novel constraint handling approach based on constraint programming. Renewable Energy 126 C (2018) 341\u2013353.","DOI":"10.1016\/j.renene.2018.03.053"},{"key":"e_1_3_3_2_40_2","doi-asserted-by":"crossref","unstructured":"Barbaros\u00a0C Tansel Richard\u00a0L Francis Timothy\u00a0J Lowe and ML Chen. 1982. Duality and distance constraints for the nonlinear p-center problem and covering problem on a tree network. Operations Research 30 4 (1982) 725\u2013744.","DOI":"10.1287\/opre.30.4.725"},{"key":"e_1_3_3_2_41_2","doi-asserted-by":"publisher","unstructured":"Golbarg\u00a0Kazemi Tutunchi and Yahya Fathi. 2019. Effective methods for solving the Bi-criteria p-Center and p-Dispersion problem. Computers & Operations Research 101 (2019) 43\u201354. 10.1016\/j.cor.2018.08.009","DOI":"10.1016\/j.cor.2018.08.009"},{"key":"e_1_3_3_2_42_2","doi-asserted-by":"crossref","unstructured":"SB Welch and Said Salhi. 1997. The obnoxious p facility network location problem with facility interaction. European Journal of Operations Research 102 (1997) 302\u2013319.","DOI":"10.1016\/S0377-2217(97)00111-2"},{"key":"e_1_3_3_2_43_2","doi-asserted-by":"crossref","unstructured":"Haluk Yapicioglu Alice\u00a0E Smith and Gerry Dozier. 2007. Solving the semi-desirable facility location problem using bi-objective particle swarm. European Journal of Operational Research 177 2 (2007) 733\u2013749.","DOI":"10.1016\/j.ejor.2005.11.020"}],"event":{"name":"SETN 2024: 13th Hellenic Conference on Artificial Intelligence","location":"Piraeus Greece","acronym":"SETN 2024"},"container-title":["Proceedings of the 13th Hellenic Conference on Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3688671.3688764","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3688671.3688764","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:31Z","timestamp":1750295431000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3688671.3688764"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,11]]},"references-count":42,"alternative-id":["10.1145\/3688671.3688764","10.1145\/3688671"],"URL":"https:\/\/doi.org\/10.1145\/3688671.3688764","relation":{},"subject":[],"published":{"date-parts":[[2024,9,11]]},"assertion":[{"value":"2024-12-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}