{"id":"https://openalex.org/W7168166375","doi":"https://doi.org/10.4230/lipics.cp.2026.30","title":"Modeling the p-Dispersion Problem with Distance Constraints","display_name":"Modeling the p-Dispersion Problem with Distance Constraints","alternate_titles":[],"publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7168166375","doi":"https://doi.org/10.4230/lipics.cp.2026.30"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26662","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2026.30","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol379-cp2026/LIPIcs.CP.2026.30/LIPIcs.CP.2026.30.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"parent_works":[{"id":"https://openalex.org/W7168167760","display_name":"LIPIcs, Volume 379, CP 2026, Complete Volume","relationship":"part"}],"lineage":["https://openalex.org/W7168166375","https://openalex.org/W7168167760"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol379-cp2026/LIPIcs.CP.2026.30/LIPIcs.CP.2026.30.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5115677498","display_name":"Panteleimon Iosif","orcid":"https://orcid.org/0009-0001-4589-3346","observed_orcids":["https://orcid.org/0009-0001-4589-3346"]},"institutions":[{"id":"https://openalex.org/I89506807","display_name":"University of Western Macedonia","ror":"https://ror.org/00a5pe906","country_code":"GR","type":"education","lineage":["https://openalex.org/I89506807"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Iosif, Panteleimon","raw_affiliation_strings":["University of Western Macedonia, Kozani, Greece"],"raw_orcid":"https://orcid.org/0009-0001-4589-3346","affiliations":[{"raw_affiliation_string":"University of Western Macedonia, Kozani, Greece","institution_ids":["https://openalex.org/I89506807"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010858186","display_name":"\u039d\u03b9\u03ba\u03cc\u03bb\u03b1\u03bf\u03c2 \u03a0\u03bb\u03cc\u03c3\u03ba\u03b1\u03c2","orcid":"https://orcid.org/0000-0001-5876-9945","observed_orcids":["https://orcid.org/0000-0001-5876-9945"]},"institutions":[{"id":"https://openalex.org/I89506807","display_name":"University of Western Macedonia","ror":"https://ror.org/00a5pe906","country_code":"GR","type":"education","lineage":["https://openalex.org/I89506807"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Ploskas, Nikolaos","raw_affiliation_strings":["University of Western Macedonia, Kozani, Greece"],"raw_orcid":"https://orcid.org/0000-0001-5876-9945","affiliations":[{"raw_affiliation_string":"University of Western Macedonia, Kozani, Greece","institution_ids":["https://openalex.org/I89506807"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019222560","display_name":"Kostas Stergiou","orcid":"https://orcid.org/0000-0002-5702-9096","observed_orcids":["https://orcid.org/0000-0002-5702-9096"]},"institutions":[{"id":"https://openalex.org/I89506807","display_name":"University of Western Macedonia","ror":"https://ror.org/00a5pe906","country_code":"GR","type":"education","lineage":["https://openalex.org/I89506807"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Stergiou, Kostas","raw_affiliation_strings":["University of Western Macedonia, Kozani, Greece"],"raw_orcid":"https://orcid.org/0000-0002-5702-9096","affiliations":[{"raw_affiliation_string":"University of Western Macedonia, Kozani, Greece","institution_ids":["https://openalex.org/I89506807"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090844108","display_name":"Dimosthenis C. Tsouros","orcid":"https://orcid.org/0000-0002-3040-0959","observed_orcids":["https://orcid.org/0000-0002-3040-0959"]},"institutions":[{"id":"https://openalex.org/I89506807","display_name":"University of Western Macedonia","ror":"https://ror.org/00a5pe906","country_code":"GR","type":"education","lineage":["https://openalex.org/I89506807"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Tsouros, Dimos","raw_affiliation_strings":["University of Western Macedonia, Kozani, Greece"],"raw_orcid":"https://orcid.org/0000-0002-3040-0959","affiliations":[{"raw_affiliation_string":"University of Western Macedonia, Kozani, Greece","institution_ids":["https://openalex.org/I89506807"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I89506807"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.6708999872207642,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.6708999872207642,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.28369998931884766,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.00559999980032444,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/distance-constraints","display_name":"distance constraints","score":0.9380000233650208},{"id":"https://openalex.org/keywords/facility-location","display_name":"facility location","score":0.8190000057220459},{"id":"https://openalex.org/keywords/constraint-programming-models","display_name":"constraint programming models","score":0.8090000152587891},{"id":"https://openalex.org/keywords/global-constraints","display_name":"global constraints","score":0.7509999871253967},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7139999866485596}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.676800012588501},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5218999981880188},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5002999901771545},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4645000100135803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46129998564720154},{"id":"https://openalex.org/C59594135","wikidata":"https://www.wikidata.org/wiki/Q5249242","display_name":"Decision model","level":2,"score":0.4505999982357025},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.42149999737739563},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.39640000462532043},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.3806999921798706},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.367000013589859},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35670000314712524},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.35190001130104065},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.31779998540878296},{"id":"https://openalex.org/C150325174","wikidata":"https://www.wikidata.org/wiki/Q4335500","display_name":"Optimal decision","level":3,"score":0.3154999911785126},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.3125999867916107},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.31150001287460327},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.30329999327659607},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.3025999963283539},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3009999990463257},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.29829999804496765},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.28349998593330383},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.2815000116825104},{"id":"https://openalex.org/C56289965","wikidata":"https://www.wikidata.org/wiki/Q5249246","display_name":"Decision tree model","level":3,"score":0.2653000056743622},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.25600001215934753},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.25360000133514404},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26662","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2026.30","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol379-cp2026/LIPIcs.CP.2026.30/LIPIcs.CP.2026.30.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.cp.2026.30","doi":"https://doi.org/10.4230/lipics.cp.2026.30","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cp.2026.30","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26662","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2026.30","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol379-cp2026/LIPIcs.CP.2026.30/LIPIcs.CP.2026.30.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320337753","display_name":"Interreg","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7168166375.pdf","grobid_xml":"https://content.openalex.org/works/W7168166375.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W61564718","https://openalex.org/W137179583","https://openalex.org/W1839939441","https://openalex.org/W1991905748","https://openalex.org/W2066453010","https://openalex.org/W2093819975","https://openalex.org/W2102747382","https://openalex.org/W2103567512","https://openalex.org/W2162372265","https://openalex.org/W2420904346","https://openalex.org/W2790098940","https://openalex.org/W3195501702","https://openalex.org/W3204795379","https://openalex.org/W4211046830","https://openalex.org/W4304695344","https://openalex.org/W6928933603","https://openalex.org/W6966766175","https://openalex.org/W7168182239"],"related_works":["https://openalex.org/W6928933603","https://openalex.org/W2420904346","https://openalex.org/W2102747382","https://openalex.org/W6966766175","https://openalex.org/W1986998000","https://openalex.org/W4392042179","https://openalex.org/W7099327340","https://openalex.org/W2980493098","https://openalex.org/W2889430680"],"abstract_inverted_index":{"We":[0,143],"study":[1],"the":[2,12,19,32,52,66,75,81,108,119,132,148,151,166,173,178,195],"p-dispersion":[3,14],"problem":[4,86,133],"with":[5,168],"distance":[6,34],"constraints":[7,43,68],"(pDD),":[8],"a":[9,17,24,61,98,111,126],"variant":[10],"of":[11,26,38,121,138,150,201],"well-known":[13],"problem.":[15,113],"In":[16,114],"pDD,":[18],"goal":[20],"is":[21,60,160,190],"to":[22,30,41,80,162,194],"locate":[23],"set":[25],"facilities":[27],"so":[28],"as":[29,85,110],"maximize":[31],"minimum":[33,45],"between":[35],"any":[36],"two":[37],"them,":[39],"subject":[40],"additional":[42],"specifying":[44],"allowed":[46],"distances.":[47],"Two":[48],"CP":[49],"models":[50],"for":[51],"pDD":[53,109],"have":[54],"recently":[55],"been":[56],"proposed.":[57],"The":[58,94],"first":[59],"typical":[62],"model":[63,90,96,129,159,167,189],"that":[64,101,130,163,186],"includes":[65],"global":[67,139,169],"Minimum":[69],"and":[70,72,181,204],"Element":[71],"explicitly":[73],"represents":[74],"objective":[76],"function,":[77],"connecting":[78],"it":[79],"decision":[82,152],"variables.":[83],"However,":[84],"size":[87],"grows,":[88],"this":[89,115],"becomes":[91],"increasingly":[92],"inefficient.":[93],"second":[95],"adopts":[97],"simplistic":[99],"approach":[100],"only":[102],"uses":[103],"binary":[104,141],"constraints,":[105,136,170],"essentially":[106],"treating":[107],"satisfaction":[112],"paper,":[116],"after":[117],"demonstrating":[118],"deficiencies":[120],"these":[122],"models,":[123],"we":[124],"propose":[125],"new":[127,158,188],"compact":[128],"captures":[131],"through":[134],"ternary":[135],"instead":[137],"or":[140],"ones.":[142],"prove":[144],"that,":[145],"rather":[146],"surprisingly,":[147],"pruning":[149],"variables'":[153],"domains":[154],"achieved":[155,164],"in":[156,165,172,199],"our":[157,187],"equivalent":[161],"resulting":[171],"same":[174,179],"search":[175],"tree":[176],"under":[177],"variable":[180],"value":[182],"ordering.":[183],"Experiments":[184],"demonstrate":[185],"by":[191],"far":[192],"superior":[193],"existing":[196],"ones,":[197],"both":[198],"terms":[200],"solution":[202],"quality":[203],"run":[205],"times.":[206]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7168166375","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2026-07-14T00:00:00"}
