{"id":"https://openalex.org/W7138071569","doi":"https://doi.org/10.1609/aaai.v40i17.38447","title":"Assignment Problems in Cost Function Networks","display_name":"Assignment Problems in Cost Function Networks","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7138071569","doi":"https://doi.org/10.1609/aaai.v40i17.38447"},"language":null,"primary_location":{"id":"doi:10.1609/aaai.v40i17.38447","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i17.38447","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1609/aaai.v40i17.38447","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129714399","display_name":"Guidio Sewa","orcid":null},"institutions":[{"id":"https://openalex.org/I1314251682","display_name":"Institut National de la Recherche Agronomique","ror":"https://ror.org/05y503v71","country_code":"MA","type":"facility","lineage":["https://openalex.org/I1314251682"]}],"countries":["MA"],"is_corresponding":true,"raw_author_name":"Guidio Sewa","raw_affiliation_strings":["INRAE\nANITI"],"affiliations":[{"raw_affiliation_string":"INRAE\nANITI","institution_ids":["https://openalex.org/I1314251682"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020658046","display_name":"David Allouche","orcid":"https://orcid.org/0000-0003-3549-4592"},"institutions":[{"id":"https://openalex.org/I4210088668","display_name":"Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement","ror":"https://ror.org/003vg9w96","country_code":"FR","type":"government","lineage":["https://openalex.org/I4210088668"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"David Allouche","raw_affiliation_strings":["INRAE"],"affiliations":[{"raw_affiliation_string":"INRAE","institution_ids":["https://openalex.org/I4210088668"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5105411790","display_name":"Simon de Givry","orcid":null},"institutions":[{"id":"https://openalex.org/I1314251682","display_name":"Institut National de la Recherche Agronomique","ror":"https://ror.org/05y503v71","country_code":"MA","type":"facility","lineage":["https://openalex.org/I1314251682"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Simon De Givry","raw_affiliation_strings":["INRAE\nANITI"],"affiliations":[{"raw_affiliation_string":"INRAE\nANITI","institution_ids":["https://openalex.org/I1314251682"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129732128","display_name":"George Katsirelos","orcid":null},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210088668","display_name":"Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement","ror":"https://ror.org/003vg9w96","country_code":"FR","type":"government","lineage":["https://openalex.org/I4210088668"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"George Katsirelos","raw_affiliation_strings":["INRAE\nANITI\nUniversit\u00e9 Paris-Saclay"],"affiliations":[{"raw_affiliation_string":"INRAE\nANITI\nUniversit\u00e9 Paris-Saclay","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I4210088668"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040302142","display_name":"Pierre Montalbano","orcid":"https://orcid.org/0000-0001-8126-892X"},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Pierre Montalbano","raw_affiliation_strings":["Universit\u00e9 Fran\u00e7ois Rabelais de Tours"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Fran\u00e7ois Rabelais de Tours","institution_ids":["https://openalex.org/I110017253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5129678348","display_name":"Thomas Schiex","orcid":null},"institutions":[{"id":"https://openalex.org/I1314251682","display_name":"Institut National de la Recherche Agronomique","ror":"https://ror.org/05y503v71","country_code":"MA","type":"facility","lineage":["https://openalex.org/I1314251682"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Thomas Schiex","raw_affiliation_strings":["INRAE\nANITI"],"affiliations":[{"raw_affiliation_string":"INRAE\nANITI","institution_ids":["https://openalex.org/I1314251682"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5129714399"],"corresponding_institution_ids":["https://openalex.org/I1314251682"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3125,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"17","first_page":"14322","last_page":"14330"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9549999833106995,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9549999833106995,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.007799999788403511,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.006099999882280827,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5658000111579895},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.526199996471405},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5224000215530396},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4880000054836273},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.484499990940094},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4449999928474426},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.3732999861240387},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.3653999865055084},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3440000116825104}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5712000131607056},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5658000111579895},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.526199996471405},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5224000215530396},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4880000054836273},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.484499990940094},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46230000257492065},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4449999928474426},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4449999928474426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4366999864578247},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.3732999861240387},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3653999865055084},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3440000116825104},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.3345000147819519},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.32359999418258667},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.322299987077713},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.3188999891281128},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.30559998750686646},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.30329999327659607},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.2924000024795532},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2874000072479248},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.26750001311302185},{"id":"https://openalex.org/C145671259","wikidata":"https://www.wikidata.org/wiki/Q1493786","display_name":"Discrete optimization","level":3,"score":0.263700008392334}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/aaai.v40i17.38447","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i17.38447","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v40i17.38447","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i17.38447","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"To":[0],"efficiently":[1,93],"solve":[2],"exact":[3],"discrete":[4],"optimization":[5],"problems,":[6],"branch":[7],"and":[8,153],"bound":[9,33],"algorithms":[10,104],"require":[11],"tight":[12],"bounds.":[13],"In":[14,85],"constraint":[15],"programming,":[16],"for":[17,79,105,126,148,157],"optimization,":[18],"soft":[19,44,70,95,123],"arc":[20,71],"consistencies":[21,34,46,55,72,125],"typically":[22],"derive":[23],"much":[24],"stronger":[25],"bounds":[26],"than":[27],"those":[28],"offered":[29,76],"by":[30],"domain":[31,54,139],"or":[32],"applied":[35],"to":[36],"a":[37],"cost":[38,49],"variable.":[39],"The":[40],"reason":[41],"is":[42,62],"that":[43],"local":[45,96,124],"exchange":[47],"marginal":[48],"information":[50],"between":[51],"variables":[52],"whereas":[53],"rely":[56],"only":[57],"on":[58,103],"shrinking":[59],"domains,":[60],"which":[61],"less":[63],"informative.":[64],"However,":[65],"CP":[66,120,141],"solvers":[67,147],"equipped":[68,131],"with":[69,132,165],"have":[73],"so":[74],"far":[75],"limited":[77],"support":[78],"efficient":[80],"processing":[81],"of":[82,160],"global":[83],"constraints.":[84,167],"this":[86,113,133],"work,":[87],"we":[88,91],"show":[89,129],"how":[90],"can":[92],"enforce":[94],"consistency":[97],"over":[98],"the":[99,106,117,149,161],"AllDifferent":[100,166],"constraint,":[101],"relying":[102],"Linear":[107],"Assignment":[108,151],"Problem":[109,152],"(LAP).":[110],"We":[111,128],"implement":[112],"propagator":[114],"in":[115],"toulbar2,":[116],"state-of-the-art":[118,138],"weighted":[119],"solver":[121],"exploiting":[122],"bounding.":[127],"that,":[130],"new":[134],"propagator,":[135],"toulbar2":[136],"outperforms":[137],"consistency-based":[140],"as":[142,144],"well":[143],"integer":[145],"programming":[146],"Quadratic":[150],"shows":[154],"better":[155],"performance":[156],"miniCOP":[158],"instances":[159],"2024":[162],"XCSP":[163],"competition":[164]},"counts_by_year":[],"updated_date":"2026-03-20T20:47:17.329874","created_date":"2026-03-18T00:00:00"}