{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:42:26Z","timestamp":1773481346761,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,1,23]],"date-time":"2017-01-23T00:00:00Z","timestamp":1485129600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the Fundamental Research Funds for the Central University of China","award":["106112013CDJZR180013"],"award-info":[{"award-number":["106112013CDJZR180013"]}]},{"name":"the Postdoctoral Science Foundation of Chongqing in China","award":["Xm201324"],"award-info":[{"award-number":["Xm201324"]}]},{"name":"the Innovation Projects in Chongqing","award":["CYS14018"],"award-info":[{"award-number":["CYS14018"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10462-017-9540-z","type":"journal-article","created":{"date-parts":[[2017,1,23]],"date-time":"2017-01-23T07:52:40Z","timestamp":1485157960000},"page":"161-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["BD-ADOPT: a hybrid DCOP algorithm with best-first and depth-first search strategies"],"prefix":"10.1007","volume":"50","author":[{"given":"Ziyu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Chen","family":"He","sequence":"additional","affiliation":[]},{"given":"Zhen","family":"He","sequence":"additional","affiliation":[]},{"given":"Minyou","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,23]]},"reference":[{"key":"9540_CR1","doi-asserted-by":"crossref","unstructured":"Ali SM, Koenig S, Tambe M (2004) Preprocessing techniques for distributed constraint optimization. In: Principles and practice of constraint programming CP 2004, Springer, pp 706\u2013710","DOI":"10.1007\/978-3-540-30201-8_51"},{"issue":"5439","key":"9540_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"issue":"1","key":"9540_CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.artint.2004.09.002","volume":"161","author":"R B\u00e9jar","year":"2005","unstructured":"B\u00e9jar R, Domshlak C, Fern\u00e1ndez C (2005) Sensor networks and distributed csp: communication, computation and complexity. Artif Intell 161(1):117\u2013147","journal-title":"Artif Intell"},{"issue":"21","key":"9540_CR4","doi-asserted-by":"crossref","first-page":"4626","DOI":"10.1103\/PhysRevLett.85.4626","volume":"85","author":"R Cohen","year":"2000","unstructured":"Cohen R, Erez K, Ben-Avraham D, Havlin S (2000) Resilience of the internet to random breakdowns. Phys Rev Lett 85(21):4626","journal-title":"Phys Rev Lett"},{"issue":"3","key":"9540_CR5","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10458-013-9225-1","volume":"28","author":"A Farinelli","year":"2014","unstructured":"Farinelli A, Rogers A, Jennings NR (2014) Agent-based decentralised coordination for sensor networks using the max-sum algorithm. Auton Agents Multi-Agent Syst 28(3):337\u2013380","journal-title":"Auton Agents Multi-Agent Syst"},{"key":"9540_CR6","doi-asserted-by":"crossref","unstructured":"Fioretto F, Le T, Yeoh W, Pontelli E, Son TC (2014) Improving dpop with branch consistency for solving distributed constraint optimization problems. In: Principles and practice of constraint programming, Springer, pp 307\u2013323","DOI":"10.1007\/978-3-319-10428-7_24"},{"key":"9540_CR7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.2591","volume":"34","author":"A Gershman","year":"2009","unstructured":"Gershman A, Meisels A, Zivan R (2009) Asynchronous forward bounding. J Artif Intell Res 34:25\u201346","journal-title":"J Artif Intell Res"},{"key":"9540_CR8","unstructured":"Grubshtein A (2012) Distributed search by agents with personal preferences. PhD thesis, Ben-Gurion University of the Negev"},{"key":"9540_CR9","unstructured":"Gutierrez P, Meseguer P (2010a) Saving messages in adopt-based algorithms. In: Proceedings of the 12th DCR workshop in AAMAS-10, pp 53\u201364"},{"key":"9540_CR10","doi-asserted-by":"crossref","unstructured":"Gutierrez P, Meseguer P (2010b) Saving redundant messages in bnb-adopt. In: AAAI, pp 1259\u20131260","DOI":"10.1609\/aaai.v24i1.7768"},{"key":"9540_CR11","unstructured":"Gutierrez P, Meseguer P, Yeoh W (2011) Generalizing adopt and bnb-adopt. In: IJCAI proceedings-international joint conference on artificial intelligence, vol 22, pp 554\u2013559"},{"key":"9540_CR12","doi-asserted-by":"crossref","unstructured":"Gutierrez P, Lee JH, Lei KM (2013) Maintaining soft arc consistencies in bnb-adopt $$^+$$ + during search. In: Proceedings of the twenty-third international joint conference on artificial intelligence, Springer, pp 3227\u20133228","DOI":"10.1007\/978-3-642-40627-0_30"},{"key":"9540_CR13","doi-asserted-by":"crossref","unstructured":"Hirayama K, Yokoo M (1997) Distributed partial constraint satisfaction problem. In: Principles and practice of constraint programming-CP97, Springer, pp 222\u2013236","DOI":"10.1007\/BFb0017442"},{"key":"9540_CR14","unstructured":"Kumar A, Petcu A, Faltings B (2008) H-dpop: Using hard constraints for search space pruning in dcop. In: AAAI, pp 325\u2013330"},{"key":"9540_CR15","unstructured":"Le T, Son TC, Pontelli E, Yeoh W (2014) Asp-dpop: solving distributed constraint optimization problems with logic programming. In: Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems, International Foundation for Autonomous Agents and Multiagent Systems, pp 1337\u20131338"},{"key":"9540_CR16","doi-asserted-by":"crossref","unstructured":"Leite AR, Giacomet B, Enembreck F (2009) Railroad driving model based on distributed constraint optimization. In: Proceedings of the 2009 IEEE\/WIC\/ACM international joint conference on web intelligence and intelligent agent technology, vol 02, IEEE Computer Society, pp 474\u2013481","DOI":"10.1109\/WI-IAT.2009.197"},{"issue":"11","key":"9540_CR17","doi-asserted-by":"crossref","first-page":"5139","DOI":"10.1016\/j.eswa.2014.02.039","volume":"41","author":"AR Leite","year":"2014","unstructured":"Leite AR, Enembreck F, Barth\u00e8s JPA (2014) Distributed constraint optimization problems: review and perspectives. Expert Syst Appl 41(11):5139\u20135157","journal-title":"Expert Syst Appl"},{"key":"9540_CR18","first-page":"246","volume":"95","author":"JS Liu","year":"1995","unstructured":"Liu JS, Sycara KP (1995) Exploiting problem structure for distributed constraint optimization. ICMAS 95:246\u2013254","journal-title":"ICMAS"},{"key":"9540_CR19","unstructured":"Maheswaran RT, Pearce JP, Tambe M (2004a) Distributed algorithms for dcop: a graphical-game-based approach. In: ISCA PDCS, pp 432\u2013439"},{"key":"9540_CR20","unstructured":"Maheswaran RT, Tambe M, Bowring E (2004b) Taking dcop to the real world: efficient complete solutions for distributed multi-event scheduling. In: Proceedings of the third international joint conference on autonomous agents and multiagent systems, vol 1, IEEE Computer Society, pp 310\u2013317"},{"key":"9540_CR21","doi-asserted-by":"crossref","unstructured":"Maheswaran RT, Pearce JP, Tambe M (2006) A family of graphical-game-based algorithms for distributed constraint optimization problems. In: Coordination of large-scale multiagent systems, Springer, pp 127\u2013146","DOI":"10.1007\/0-387-27972-5_6"},{"key":"9540_CR22","unstructured":"Mailler R, Lesser V (2004) Solving distributed constraint optimization problems using cooperative mediation. In: Proceedings of the third international joint conference on autonomous agents and multiagent systems, vol 1, IEEE Computer Society, pp 438\u2013445"},{"issue":"1\u20132","key":"9540_CR23","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.artint.2004.09.003","volume":"161","author":"PJ Modi","year":"2005","unstructured":"Modi PJ, Shen WM, Tambe M (2005) Adopt: asynchronous distributed constraint optimization with quality guarantees. Artif Intell 161(1\u20132):149\u2013180","journal-title":"Artif Intell"},{"key":"9540_CR24","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.artint.2012.09.002","volume":"193","author":"A Netzer","year":"2012","unstructured":"Netzer A, Grubshtein A, Meisels A (2012) Concurrent forward bounding for distributed constraint optimization problems. Artif Intell 193:186\u2013216","journal-title":"Artif Intell"},{"key":"9540_CR25","unstructured":"Nguyen DT, Yeoh W, Lau HC (2013) Distributed gibbs: a memory-bounded sampling-based dcop algorithm. In: Proceedings of the 2013 international conference on autonomous agents and multi-agent systems, International Foundation for Autonomous Agents and Multiagent Systems, pp 167\u2013174"},{"key":"9540_CR26","unstructured":"Ottens B, Dimitrakakis C, Faltings B (2012) Duct: an upper confidence bound approach to distributed constraint optimization problems. In: Proceedings of the national conference on artificial intelligence, vol 1, pp 528\u2013534"},{"key":"9540_CR27","unstructured":"Petcu A, Faltings B (2005) A scalable method for multiagent constraint optimization. In: 19th international joint conference on artificial intelligence (Ijcai-05), pp 266\u2013271"},{"key":"9540_CR28","unstructured":"Petcu A, Faltings B (2007) Mb-dpop: a new memory-bounded algorithm for distributed optimization. In: IJCAI, pp 1452\u20131457"},{"issue":"2","key":"9540_CR29","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1016\/j.artint.2010.11.001","volume":"175","author":"A Rogers","year":"2011","unstructured":"Rogers A, Farinelli A, Stranders R, Jennings NR (2011) Bounded approximate decentralised coordination via the max-sum algorithm. Artif Intell 175(2):730\u2013759","journal-title":"Artif Intell"},{"key":"9540_CR30","doi-asserted-by":"crossref","unstructured":"Silaghi MC, Yokoo M (2006) Nogood based asynchronous distributed optimization (adopt ng). In: Proceedings of the fifth international joint conference on autonomous agents and multiagent systems, ACM, pp 1389\u20131396","DOI":"10.1145\/1160633.1160894"},{"issue":"2","key":"9540_CR31","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10458-008-9069-2","volume":"19","author":"MC Silaghi","year":"2009","unstructured":"Silaghi MC, Yokoo M (2009) Adopt-ing: unifying asynchronous distributed optimization with asynchronous backtracking. Auton Agents Multi-Agent Syst 19(2):89\u2013123","journal-title":"Auton Agents Multi-Agent Syst"},{"key":"9540_CR32","unstructured":"Vinyals M, Rodriguez-Aguilar JA, Cerquides J (2009) Generalizing dpop: action-gdl, a new complete algorithm for dcops. In: Proceedings of The 8th international conference on autonomous agents and multiagent systems, vol 2. International Foundation for Autonomous Agents and Multiagent Systems, pp 1239\u20131240"},{"key":"9540_CR33","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1613\/jair.2849","volume":"38","author":"W Yeoh","year":"2010","unstructured":"Yeoh W, Felner A, Koenig S (2010) Bnb-adopt: an asynchronous branch-and-bound dcop algorithm. J Artif Intell Res 38:85\u2013133","journal-title":"J Artif Intell Res"},{"issue":"1","key":"9540_CR34","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.artint.2004.10.004","volume":"161","author":"W Zhang","year":"2005","unstructured":"Zhang W, Wang G, Xing Z (2005) Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks. Artif Intell 161(1):55\u201387","journal-title":"Artif Intell"},{"issue":"4","key":"9540_CR35","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/s10472-006-9033-2","volume":"46","author":"R Zivan","year":"2006","unstructured":"Zivan R, Meisels A (2006) Message delay and discsp search algorithms. Ann Math Artif Intell 46(4):415\u2013439","journal-title":"Ann Math Artif Intell"},{"key":"9540_CR36","unstructured":"Zivan R, Peled H (2012) Max\/min-sum distributed constraint optimization through value propagation on an alternating dag. In: Proceedings of the 11th international conference on autonomous agents and multiagent systems, Vol 1. International Foundation for Autonomous Agents and Multiagent Systems, pp 265\u2013272"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10462-017-9540-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-017-9540-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-017-9540-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T22:03:39Z","timestamp":1692655419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10462-017-9540-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,23]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["9540"],"URL":"https:\/\/doi.org\/10.1007\/s10462-017-9540-z","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"value":"0269-2821","type":"print"},{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,23]]}}}