{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T05:33:10Z","timestamp":1761197590221,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T00:00:00Z","timestamp":1537833600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002865","name":"Chongqing Science and Technology Commission","doi-asserted-by":"publisher","award":["cstc2017jcyjAX0030"],"award-info":[{"award-number":["cstc2017jcyjAX0030"]}],"id":[{"id":"10.13039\/501100002865","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002338","name":"Ministry of Education of the People\u2019s Republic of China","doi-asserted-by":"publisher","award":["2018CDXYJSJ0026"],"award-info":[{"award-number":["2018CDXYJSJ0026"]}],"id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002369","name":"Chongqing University","doi-asserted-by":"publisher","award":["CYS18047"],"award-info":[{"award-number":["CYS18047"]}],"id":[{"id":"10.13039\/501100002369","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10458-018-9395-y","type":"journal-article","created":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T06:50:03Z","timestamp":1537858203000},"page":"822-860","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A class of iterative refined Max-sum algorithms via non-consecutive value propagation strategies"],"prefix":"10.1007","volume":"32","author":[{"given":"Ziyu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Yanchen","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Tengfei","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Zhongshi","family":"He","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,25]]},"reference":[{"issue":"2","key":"9395_CR1","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/18.825794","volume":"46","author":"SM Aji","year":"2000","unstructured":"Aji, S. M., & McEliece, R. J. (2000). The generalized distributive law. IEEE Transactions on Information Theory, 46(2), 325\u2013343.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5439","key":"9395_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A. L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286(5439), 509\u2013512.","journal-title":"Science"},{"unstructured":"Chen, Z., Deng, Y., & Wu, T. (2017). An iterative refined Max-sum_ad algorithm via single-side value propagation and local search. In Proceedings of the 16th conference on autonomous agents and multiagent systems (pp. 195\u2013202). International Foundation for Autonomous Agents and Multiagent Systems.","key":"9395_CR3"},{"doi-asserted-by":"crossref","unstructured":"Cohen, L., & Zivan, R. (2017). Max-sum revisited: The real power of damping. In Proceedings of the 16th conference on autonomous agents and multiagent systems (pp. 1505\u20131507). International Foundation for Autonomous Agents and Multiagent Systems.","key":"9395_CR4","DOI":"10.1007\/978-3-319-71679-4_8"},{"issue":"1","key":"9395_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0004-3702(99)00059-4","volume":"113","author":"R Dechter","year":"1999","unstructured":"Dechter, R. (1999). Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113(1), 41\u201385.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9395_CR6","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.jnca.2011.02.016","volume":"35","author":"F Enembreck","year":"2012","unstructured":"Enembreck, F., & Barths, J. P. A. (2012). Distributed constraint optimization with mulbs: A case study on collaborative meeting scheduling. Journal of Network and Computer Applications, 35(1), 164\u2013175.","journal-title":"Journal of Network and Computer Applications"},{"unstructured":"Farinelli, A., Rogers, A., Petcu, A., & Jennings, N.\u00a0R. (2008). Decentralised coordination of low-power embedded devices using the Max-sum algorithm. In Proceedings of the 7th international joint conference on autonomous agents and multiagent systems (Vol. 2, pp. 639\u2013646). International Foundation for Autonomous Agents and Multiagent Systems.","key":"9395_CR7"},{"key":"9395_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1613\/jair.2591","volume":"34","author":"A Gershman","year":"2009","unstructured":"Gershman, A., Meisels, A., & Zivan, R. (2009). Asynchronous forward bounding for distributed cops. Journal of Artificial Intelligence Research, 34, 61\u201388.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"9395_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.artint.2004.08.004","volume":"161","author":"K Hirayama","year":"2005","unstructured":"Hirayama, K., & Yokoo, M. (2005). The distributed breakout algorithms. Artificial Intelligence, 161(1), 89\u2013115.","journal-title":"Artificial Intelligence"},{"unstructured":"Katagishi, H., & Pearce, J.\u00a0P. (2007). Kopt: Distributed dcop algorithm for arbitrary k-optima with monotonically increasing utility. In Ninth DCR workshop (CP-07).","key":"9395_CR10"},{"issue":"2","key":"9395_CR11","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"FR Kschischang","year":"2001","unstructured":"Kschischang, F. R., Frey, B. J., & Loeliger, H. A. (2001). Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory, 47(2), 498\u2013519.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"9395_CR12","doi-asserted-by":"publisher","first-page":"5139","DOI":"10.1016\/j.eswa.2014.02.039","volume":"41","author":"AR Leite","year":"2014","unstructured":"Leite, A. R., Enembreck, F., & Barth\u00e8s, J. P. A. (2014). Distributed constraint optimization problems: Review and perspectives. Expert Systems with Applications, 41(11), 5139\u20135157.","journal-title":"Expert Systems with Applications"},{"key":"9395_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.artint.2017.07.003","volume":"252","author":"O Litov","year":"2017","unstructured":"Litov, O., & Meisels, A. (2017). Forward bounding on pseudo-trees for dcops and adcops. Artificial Intelligence, 252, 83\u201399.","journal-title":"Artificial Intelligence"},{"unstructured":"Maheswaran, R.\u00a0T., Pearce, J.\u00a0P., & Tambe, M. (2004). Distributed algorithms for dcop: A graphical-game-based approach. In ISCA PDCS (pp. 432\u2013439).","key":"9395_CR14"},{"unstructured":"Meisels, A., & Lavee, O. (2004). Using additional information in discsp search. In Distributed constraint reasoning workshop (DCR).","key":"9395_CR15"},{"issue":"1","key":"9395_CR16","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.artint.2004.09.003","volume":"161","author":"PJ Modi","year":"2005","unstructured":"Modi, P. J., Shen, W. M., Tambe, M., & Yokoo, M. (2005). Adopt: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence, 161(1), 149\u2013180.","journal-title":"Artificial Intelligence"},{"key":"9395_CR17","doi-asserted-by":"publisher","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. Artificial Intelligence, 193, 186\u2013216.","journal-title":"Artificial Intelligence"},{"unstructured":"Nguyen, D.\u00a0T., Yeoh, W., & Lau, H.\u00a0C. (2013). Distributed gibbs: A memory-bounded sampling-based dcop algorithm. In Proceedings of the 12th international conference on autonomous agents and multi-agent systems (pp. 167\u2013174). International Foundation for Autonomous Agents and Multiagent Systems.","key":"9395_CR18"},{"doi-asserted-by":"crossref","unstructured":"Okimoto, T., Joe, Y., Iwasaki, A., Yokoo, M., & Faltings, B. (2011). Pseudo-tree-based incomplete algorithm for distributed constraint optimization with quality bounds. In International conference on principles and practice of constraint programming (pp. 660\u2013674). Springer.","key":"9395_CR19","DOI":"10.1007\/978-3-642-23786-7_50"},{"issue":"5","key":"9395_CR20","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/3066156","volume":"8","author":"B Ottens","year":"2017","unstructured":"Ottens, B., Dimitrakakis, C., & Faltings, B. (2017). Duct: An upper confidence bound approach to distributed constraint optimization problems. ACM Transactions on Intelligent Systems and Technology, 8(5), 69.","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"unstructured":"Pearce, J.\u00a0P., & Tambe, M. (2007). Quality guarantees on k-optimal solutions for distributed constraint optimization problems. In International joint conference on artifical intelligence (pp. 1446\u20131451)","key":"9395_CR21"},{"doi-asserted-by":"crossref","unstructured":"Petcu, A., & Faltings, B. (2005). Approximations in distributed optimization. In International conference on principles and practice of constraint programming (pp. 802\u2013806). Springer.","key":"9395_CR22","DOI":"10.1007\/11564751_68"},{"unstructured":"Petcu, A., & Faltings, B. (2005). A scalable method for multiagent constraint optimization. In Proceedings of the 19th international joint conference on artificial intelligence (pp. 266\u2013271).","key":"9395_CR23"},{"unstructured":"Petcu, A., & Faltings, B. (2006). Odpop: An algorithm for open\/distributed constraint optimization. In Proceedings of the 21st national conference on artificial intelligence (pp. 703\u2013708). AAAI Press.","key":"9395_CR24"},{"unstructured":"Petcu, A., & Faltings, B. (2007). Mb-dpop: A new memory-bounded algorithm for distributed optimization. In Proceedings of the 20th international joint conference on artifical intelligence (pp. 1452\u20131457). Morgan Kaufmann Publishers Inc.","key":"9395_CR25"},{"issue":"1","key":"9395_CR26","first-page":"1","volume":"3","author":"A Petcu","year":"2008","unstructured":"Petcu, A., & Faltings, B. (2008). Distributed constraint optimization applications in power networks. International Journal of Innovations in Energy Systems and Power, 3(1), 1\u201312.","journal-title":"International Journal of Innovations in Energy Systems and Power"},{"issue":"2","key":"9395_CR27","doi-asserted-by":"publisher","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, N. R. (2011). Bounded approximate decentralised coordination via the Max-sum algorithm. Artificial Intelligence, 175(2), 730\u2013759.","journal-title":"Artificial Intelligence"},{"unstructured":"Rollon, E., & Larrosa, J. (2012). Improved bounded Max-sum for distributed constraint optimization. In Proceedings of the 18th international conference on principles and practice of constraint programming (Vol. 7514, pp. 624\u2013632). Berlin, Heidelberg: Springer.","key":"9395_CR28"},{"doi-asserted-by":"crossref","unstructured":"Rollon, E., & Larrosa, J. (2014). Decomposing utility functions in bounded Max-sum for distributed constraint optimization. In International conference on principles and practice of constraint programming (pp. 646\u2013654). Springer.","key":"9395_CR29","DOI":"10.1007\/978-3-319-10428-7_47"},{"unstructured":"Steven, O., Roie, Z., & Aviv, N. (2016). Distributed breakout: Beyond satisfaction. In Proceedings of the twenty-fifth international joint conference on artificial intelligence (pp. 447\u2013453).","key":"9395_CR30"},{"unstructured":"Sultanik, E., Modi, P.\u00a0J., & Regli, W.\u00a0C. (2007). On modeling multiagent task scheduling as a distributed constraint optimization problem. In IJCAI (pp. 1531\u20131536).","key":"9395_CR31"},{"unstructured":"Vinyals, M., Rodriguez-Aguilar, J.\u00a0A., & 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, pp. 1239\u20131240). International Foundation for Autonomous Agents and Multiagent Systems.","key":"9395_CR32"},{"key":"9395_CR33","doi-asserted-by":"publisher","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. Journal of Artificial Intelligence Research, 38, 85\u2013133.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"5","key":"9395_CR34","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/69.729707","volume":"10","author":"M Yokoo","year":"1998","unstructured":"Yokoo, M., Durfee, E. H., Ishida, T., & Kuwabara, K. (1998). The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Transactions on knowledge and data engineering, 10(5), 673\u2013685.","journal-title":"IEEE Transactions on knowledge and data engineering"},{"unstructured":"Yu, Z., Chen, Z., He, J., & Deng, Y. (2017). A partial decision scheme for local search algorithms for distributed constraint optimization problems. In Proceedings of the 16th conference on autonomous agents and multiagent systems (pp. 187\u2013194). International Foundation for Autonomous Agents and Multiagent Systems.","key":"9395_CR35"},{"issue":"1","key":"9395_CR36","doi-asserted-by":"publisher","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., & Wittenburg, L. (2005). Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks. Artificial Intelligence, 161(1), 55\u201387.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"9395_CR37","first-page":"73","volume":"17","author":"S Zilberstein","year":"1996","unstructured":"Zilberstein, S. (1996). Using anytime algorithms in intelligent systems. Ai Magazine, 17(3), 73\u201383.","journal-title":"Ai Magazine"},{"key":"9395_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2014.03.002","volume":"212","author":"R Zivan","year":"2014","unstructured":"Zivan, R., Okamoto, S., & Peled, H. (2014). Explorative anytime local search for distributed constraint optimization. Artificial Intelligence, 212, 1\u201326.","journal-title":"Artificial Intelligence"},{"key":"9395_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-017-9360-1","author":"R Zivan","year":"2017","unstructured":"Zivan, R., Parash, T., Cohen, L., Peled, H., & Okamoto, S. (2017). Balancing exploration and exploitation in incomplete min\/max-sum inference for distributed constraint optimization. Autonomous Agents and Multi-Agent Systems,. \n                    https:\/\/doi.org\/10.1007\/s10458-017-9360-1\n                    \n                  .","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"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, pp. 265\u2013272). International Foundation for Autonomous Agents and Multiagent Systems.","key":"9395_CR40"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-018-9395-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-018-9395-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-018-9395-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T03:25:44Z","timestamp":1569381944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-018-9395-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,25]]},"references-count":40,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["9395"],"URL":"https:\/\/doi.org\/10.1007\/s10458-018-9395-y","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"type":"print","value":"1387-2532"},{"type":"electronic","value":"1573-7454"}],"subject":[],"published":{"date-parts":[[2018,9,25]]},"assertion":[{"value":"25 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}