{"id":"https://openalex.org/W2198729885","doi":"https://doi.org/10.5555/2343576.2343614","title":"Max/min-sum distributed constraint optimization through value propagation on an alternating DAG","display_name":"Max/min-sum distributed constraint optimization through value propagation on an alternating DAG","alternate_titles":[],"publication_year":2012,"publication_date":"2012-06-04","ids":{"openalex":"https://openalex.org/W2198729885","doi":"https://doi.org/10.5555/2343576.2343614","mag":"2198729885"},"language":"en","primary_location":{"id":"mag:2198729885","doi":"https://doi.org/10.5555/2343576.2343614","is_oa":false,"landing_page_url":"https://www.ifaamas.org/Proceedings/aamas2012/papers/2B_2.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306417597","display_name":"Adaptive Agents and Multi-Agents Systems","issn_l":"1548-8403","issn":["1548-8403"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Adaptive Agents and Multi-Agents Systems","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2198729885"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056071243","display_name":"Roie Zivan","orcid":"https://orcid.org/0000-0002-1410-8368","observed_orcids":["https://orcid.org/0000-0002-1410-8368"]},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Roie Zivan","raw_affiliation_strings":["Ben Gurion university, Beer Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben Gurion university, Beer Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081770016","display_name":"Hilla Peled","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Hilla Peled","raw_affiliation_strings":["Ben Gurion university, Beer Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben Gurion university, Beer Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":3.2327,"has_fulltext":false,"cited_by_count":45,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.91865969,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"265","last_page":"272"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994999766349792,"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.9994999766349792,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":9.999999747378752e-05,"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/T10374","display_name":"Advanced Graph Theory Research","score":9.999999747378752e-05,"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/distributed-constraint-optimization","display_name":"distributed constraint optimization","score":0.9990000128746033},{"id":"https://openalex.org/keywords/max-sum-algorithm","display_name":"max-sum algorithm","score":0.9369999766349792},{"id":"https://openalex.org/keywords/value-propagation","display_name":"value propagation","score":0.8809999823570251},{"id":"https://openalex.org/keywords/incomplete-algorithms","display_name":"incomplete algorithms","score":0.8629999756813049},{"id":"https://openalex.org/keywords/convergence","display_name":"convergence","score":0.48399999737739563}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5791358947753906},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5400112867355347},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5312910676002502},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5172122716903687},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5040475726127625},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4842774271965027},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4810126721858978},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.4284431040287018},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4233360290527344},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4175168573856354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3940836787223816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3624952435493469},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20759159326553345},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2198729885","doi":"https://doi.org/10.5555/2343576.2343614","is_oa":false,"landing_page_url":"https://www.ifaamas.org/Proceedings/aamas2012/papers/2B_2.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306417597","display_name":"Adaptive Agents and Multi-Agents Systems","issn_l":"1548-8403","issn":["1548-8403"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Adaptive Agents and Multi-Agents Systems","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.387.1463","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.1463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ifaamas.org/Proceedings/aamas2012/papers/2B_2.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W10475904","https://openalex.org/W33481259","https://openalex.org/W1520917956","https://openalex.org/W1534329790","https://openalex.org/W1548955532","https://openalex.org/W1760241490","https://openalex.org/W2011617423","https://openalex.org/W2026129786","https://openalex.org/W2037387582","https://openalex.org/W2061026055","https://openalex.org/W2065090389","https://openalex.org/W2097489639","https://openalex.org/W2101914945","https://openalex.org/W2104570951","https://openalex.org/W2110116921","https://openalex.org/W2114225169","https://openalex.org/W2118826835","https://openalex.org/W2137813581","https://openalex.org/W2138881688","https://openalex.org/W2144836051","https://openalex.org/W3121729118","https://openalex.org/W7124169210"],"related_works":["https://openalex.org/W2592679135","https://openalex.org/W157177521","https://openalex.org/W2621213575","https://openalex.org/W2992865406","https://openalex.org/W4299130567","https://openalex.org/W2899441093","https://openalex.org/W2996864500","https://openalex.org/W2285798699","https://openalex.org/W2621426788","https://openalex.org/W2996175894"],"abstract_inverted_index":{"Distributed":[0],"Constraint":[1],"Optimization":[2],"Problems":[3],"(DCOPs)":[4],"are":[5,81],"NPhard":[6],"and":[7,32,75,127,136,190],"therefore":[8],"the":[9,23,63,70,76,90,103,138,143,160,163,180,184],"number":[10,38],"of":[11,39,59,82,102,125,162],"studies":[12],"that":[13,78,106,129],"consider":[14],"incomplete":[15,93],"algorithms":[16,94],"for":[17,95],"solving":[18,173],"them":[19],"is":[20],"growing.":[21],"Specifically,":[22],"Max-sum":[24,46,68,104,126,186,189],"algorithm":[25,71,105],"has":[26,33],"drawn":[27],"attention":[28],"in":[29,43,62,118,159],"recent":[30],"years":[31],"been":[34],"applied":[35],"to":[36,133,150],"a":[37,100,156],"realistic":[40],"applications.":[41],"Unfortunately,":[42],"many":[44],"cases":[45],"does":[47,72],"not":[48,73],"produce":[49],"high":[50],"quality":[51,161],"solutions.":[52],"More":[53],"specifically,":[54],"when":[55,172],"problems":[56,145,174],"include":[57,176],"cycles":[58],"various":[60],"sizes":[61],"factor":[64],"graph":[65,113],"upon":[66],"which":[67,115,175],"performs,":[69],"converge":[74],"states":[77],"it":[79],"visits":[80],"low":[83],"quality.":[84],"In":[85],"this":[86],"paper":[87],"we":[88],"advance":[89],"research":[91],"on":[92,108],"DCOPs":[96],"by:":[97],"(1)":[98],"Proposing":[99],"version":[101],"operates":[107],"an":[109],"alternating":[110],"directed":[111],"acyclic":[112],"(Maxsum_AD),":[114],"guarantees":[116],"convergence":[117],"linear":[119],"time.":[120],"(2)":[121],"Identifying":[122],"major":[123],"weaknesses":[124],"Max-sum_AD":[128,167],"cause":[130],"inconsistent":[131],"costs/utilities":[132],"be":[134],"propagated":[135],"affect":[137],"assignment":[139],"selection.":[140],"(3)":[141],"Solving":[142],"identified":[144],"by":[146,166,183],"introducing":[147],"value":[148,169,194],"propagation":[149,170],"Max-sum_AD.":[151],"Our":[152],"empirical":[153],"study":[154],"reveals":[155],"large":[157],"improvement":[158],"solutions":[164,181],"produced":[165,182],"with":[168,179,192],"(VP),":[171],"cycles,":[177],"compared":[178],"standard":[185],"algorithm,":[187],"Bounded":[188],"Maxsum_AD":[191],"no":[193],"propagation.":[195]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2198729885","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":9},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
