{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T18:49:59Z","timestamp":1777402199235,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T00:00:00Z","timestamp":1602288000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T00:00:00Z","timestamp":1602288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10489-020-01860-8","type":"journal-article","created":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T04:03:36Z","timestamp":1602302616000},"page":"1733-1746","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Speeding up distributed pseudo-tree optimization procedures with cross edge consistency to solve DCOPs"],"prefix":"10.1007","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4819-2622","authenticated-orcid":false,"given":"Mashrur","family":"Rashik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Musfiqur","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Mosaddek","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md.","family":"Mamun-or-Rashid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Tran-Thanh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas R.","family":"Jennings","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,10]]},"reference":[{"issue":"1","key":"1860_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1009812409930","volume":"4","author":"B Cabon","year":"1999","unstructured":"Cabon B, De Givry S, Lobjois L, Schiex T, Warners JP (1999) Radio link frequency assignment. Constraints 4(1):79\u201389","journal-title":"Constraints"},{"issue":"3","key":"1860_CR2","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s10489-017-0905-4","volume":"47","author":"Z Chen","year":"2017","unstructured":"Chen Z, He Z, He C (2017) An improved dpop algorithm based on breadth first search pseudo-tree for distributed constraint optimization. Appl Intell 47(3):607\u2013623","journal-title":"Appl Intell"},{"key":"1860_CR3","unstructured":"Cheng KC, Yap RH (2005) Constrained decision diagrams. In: Proceedings of the national conference on artificial intelligence, vol 20. AAAI Press, MIT Press, 1999, Menlo Park, p 366"},{"key":"1860_CR4","unstructured":"Farinelli A, Rogers A, Petcu A, Jennings NR (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-Volume 2, International Foundation for Autonomous Agents and Multiagent Systems, pp 639\u2013646"},{"key":"1860_CR5","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: International conference on principles and practice of constraint programming, Springer, pp 307\u2013323","DOI":"10.1007\/978-3-319-10428-7_24"},{"key":"1860_CR6","unstructured":"Fioretto F, Yeoh W, Pontelli E (2017) A multiagent system approach to scheduling devices in smart homes. In: Proceedings of the 16th conference on autonomous agents and multiagent systems, International Foundation for Autonomous Agents and Multiagent Systems, pp 981\u2013989"},{"key":"1860_CR7","doi-asserted-by":"crossref","unstructured":"Greenstadt R, Grosz B, Smith MD (2007) Ssdpop: improving the privacy of dcop with secret sharing. In: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, ACM, pp 171","DOI":"10.1145\/1329125.1329333"},{"key":"1860_CR8","doi-asserted-by":"crossref","unstructured":"Hirayama K, Yokoo M (1997) Distributed partial constraint satisfaction problem. In: International conference on principles and practice of constraint programming, Springer, pp 222\u2013236","DOI":"10.1007\/BFb0017442"},{"issue":"1-2","key":"1860_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. Artif Intell 161(1-2):89\u2013115","journal-title":"Artif Intell"},{"key":"1860_CR10","unstructured":"de la Hoz E, Gimenez-Guzman JM, Marsa-Maestre I, Cruz-Piris L, Orden D (2017) A distributed, multi-agent approach to reactive network resilience. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, International Foundation for Autonomous Agents and Multiagent Systems, pp 1044\u20131053"},{"key":"1860_CR11","unstructured":"Jain M, Taylor M, Tambe M, Yokoo M (2009) Dcops meet the real world: Exploring unknown reward matrices with applications to mobile sensor networks. In: Twenty-first international joint conference on artificial intelligence"},{"key":"1860_CR12","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":"1860_CR13","unstructured":"Maheswaran RT, Tambe M, Bowring E, Pearce JP, Varakantham P (2004) 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-Volume 1, IEEE Computer Society, pp 310\u2013317"},{"issue":"1-2","key":"1860_CR14","doi-asserted-by":"publisher","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, Yokoo M (2005) Adopt: Asynchronous distributed constraint optimization with quality guarantees. Artif Intell 161(1-2):149\u2013180","journal-title":"Artif Intell"},{"key":"1860_CR15","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. Artif Intell 193:186\u2013216","journal-title":"Artif Intell"},{"issue":"3","key":"1860_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.3390\/sym10030065","volume":"10","author":"D Orden","year":"2018","unstructured":"Orden D, Gimenez-Guzman J, Marsa-Maestre I, de la Hoz E (2018) Spectrum graph coloring and applications to wi-fi channel assignment. Symmetry 10(3):65","journal-title":"Symmetry"},{"key":"1860_CR17","doi-asserted-by":"crossref","unstructured":"Petcu A, Faltings B (2005) A scalable method for multiagent constraint optimization. Tech rep","DOI":"10.1007\/11600930_71"},{"key":"1860_CR18","doi-asserted-by":"crossref","unstructured":"Petcu A, Faltings B (2006) Odpop: an algorithm for open\/distributed constraint optimization. In: AAAI, vol 6, pp 703\u2013708","DOI":"10.1007\/11600930_71"},{"key":"1860_CR19","unstructured":"Petcu A, Faltings B (2007) Mb-dpop: a new memory-bounded algorithm for distributed optimization. In: IJCAI, pp 1452\u20131457"},{"key":"1860_CR20","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1613\/jair.2500","volume":"32","author":"A Petcu","year":"2008","unstructured":"Petcu A, Faltings B, Parkes DC (2008) M-dpop: Faithful distributed implementation of efficient social choice problems. J Artif Intell Res 32:705\u2013755","journal-title":"J Artif Intell Res"},{"issue":"6","key":"1860_CR21","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B Schieber","year":"1988","unstructured":"Schieber B, Vishkin U (1988) On finding lowest common ancestors: Simplification and parallelization. SIAM J Comput 17(6):1253\u20131262","journal-title":"SIAM J Comput"},{"key":"1860_CR22","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-Volume 2, International Foundation for Autonomous Agents and Multiagent Systems, pp 1239\u20131240"},{"issue":"5","key":"1860_CR23","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/69.729707","volume":"10","author":"M Yokoo","year":"1998","unstructured":"Yokoo M, Durfee EH, 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"},{"issue":"1-2","key":"1860_CR24","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. Artif Intell 161(1-2):55\u201387","journal-title":"Artif Intell"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01860-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-01860-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01860-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:54:36Z","timestamp":1633913676000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-01860-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,10]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["1860"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-01860-8","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,10]]},"assertion":[{"value":"10 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}