{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T13:40:09Z","timestamp":1751809209988,"version":"3.41.0"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319983332"},{"type":"electronic","value":"9783319983349"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98334-9_44","type":"book-chapter","created":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T12:33:14Z","timestamp":1534941194000},"page":"688-706","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A Large Neighboring Search Schema for Multi-agent Optimization"],"prefix":"10.1007","author":[{"given":"Khoi D.","family":"Hoang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferdinando","family":"Fioretto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Yeoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Pontelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roie","family":"Zivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"key":"44_CR1","first-page":"397","volume":"3","author":"P Auer","year":"2002","unstructured":"Auer, P.: Using confidence bounds for exploitation-exploration trade-offs. J. Mach. Learn. Res. 3, 397\u2013422 (2002)","journal-title":"J. Mach. Learn. Res."},{"issue":"5439","key":"44_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.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"44_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-33558-7_15","volume-title":"Principles and Practice of Constraint Programming","author":"C Bessiere","year":"2012","unstructured":"Bessiere, C., Gutierrez, P., Meseguer, P.: Including soft global constraints in DCOPs. In: Milano, M. (ed.) CP 2012. LNCS, pp. 175\u2013190. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33558-7_15"},{"doi-asserted-by":"crossref","unstructured":"Campeotto, F., Dovier, A., Fioretto, F., Pontelli, E.: A GPU implementation of large neighborhood search for solving constraint optimization problems. In: Proceedings of the European Conference on Artificial Intelligence (ECAI), pp. 189\u2013194 (2014)","key":"44_CR4","DOI":"10.3233\/978-1-61499-419-0-189"},{"unstructured":"Farinelli, A., Rogers, A., Petcu, A., Jennings, N.: Decentralised coordination of low-power embedded devices using the max-sum algorithm. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 639\u2013646 (2008)","key":"44_CR5"},{"unstructured":"Fioretto, F., Campeotto, F., Dovier, A., Pontelli, E., Yeoh, W.: Large neighborhood search with quality guarantees for distributed constraint optimization problems. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 1835\u20131836 (2015)","key":"44_CR6"},{"key":"44_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-10428-7_24","volume-title":"Principles and Practice of Constraint Programming","author":"F Fioretto","year":"2014","unstructured":"Fioretto, F., Le, T., Yeoh, W., Pontelli, E., Son, T.C.: Improving DPOP with branch consistency for solving distributed constraint optimization problems. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 307\u2013323. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_24"},{"key":"44_CR8","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1613\/jair.5565","volume":"61","author":"F Fioretto","year":"2018","unstructured":"Fioretto, F., Pontelli, E., Yeoh, W.: Distributed constraint optimization problems and applications: a survey. J. Artif. Intell. Res. 61, 623\u2013698 (2018)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"44_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10601-017-9274-1","volume":"23","author":"F Fioretto","year":"2018","unstructured":"Fioretto, F., Pontelli, E., Yeoh, W., Dechter, R.: Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs. Constraints 23(1), 1\u201343 (2018)","journal-title":"Constraints"},{"key":"44_CR10","first-page":"813","volume-title":"Lecture Notes in Computer Science","author":"Ferdinando Fioretto","year":"2016","unstructured":"Fioretto, F., Yeoh, W., Pontelli, E.: A dynamic programming-based MCMC framework for solving DCOPs with GPUs. In: Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP), pp. 813\u2013831 (2016)"},{"doi-asserted-by":"crossref","unstructured":"Fioretto, F., Yeoh, W., Pontelli, E.: Multi-variable agents decomposition for DCOPs. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 2480\u20132486 (2016)","key":"44_CR11","DOI":"10.1609\/aaai.v30i1.10127"},{"unstructured":"Fioretto, F., Yeoh, W., Pontelli, E.: A multiagent system approach to scheduling devices in smart homes. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 981\u2013989 (2017)","key":"44_CR12"},{"unstructured":"Fioretto, F., Yeoh, W., Pontelli, E., Ma, Y., Ranade, S.: A DCOP approach to the economic dispatch with demand response. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 999\u20131007 (2017)","key":"44_CR13"},{"issue":"6","key":"44_CR14","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S Geman","year":"1984","unstructured":"Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell. 6(6), 721\u2013741 (1984)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"unstructured":"Godard, D., Laborie, P., Nuijten, W.: Randomized large neighborhood search for cumulative scheduling. In: Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), vol. 5, pp. 81\u201389 (2005)","key":"44_CR15"},{"doi-asserted-by":"crossref","unstructured":"Gutierrez, P., Lee, J.H.M., Lei, K.M., Mak, T.W.K., Meseguer, P.: Maintaining Soft Arc Consistencies in BnB-ADOPT $$^+$$ during Search. In: Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP), pp. 365\u2013380 (2013)","key":"44_CR16","DOI":"10.1007\/978-3-642-40627-0_30"},{"unstructured":"Kiekintveld, C., Yin, Z., Kumar, A., Tambe, M.: Asynchronous algorithms for approximate distributed constraint optimization with quality bounds. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 133\u2013140 (2010)","key":"44_CR17"},{"key":"44_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-71679-4_9","volume-title":"Autonomous Agents and Multiagent Systems","author":"W Kluegel","year":"2017","unstructured":"Kluegel, W., Iqbal, M.A., Fioretto, F., Yeoh, W., Pontelli, E.: A realistic dataset for the smart home device scheduling problem for DCOPs. In: Sukthankar, G., Rodriguez-Aguilar, J.A. (eds.) AAMAS 2017. LNCS (LNAI), vol. 10643, pp. 125\u2013142. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71679-4_9"},{"unstructured":"Kumar, A., Faltings, B., Petcu, A.: Distributed constraint optimization with structured resource constraints. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 923\u2013930 (2009)","key":"44_CR19"},{"unstructured":"L\u00e9aut\u00e9, T., Ottens, B., Szymanek, R.: FRODO 2.0: an open-source framework for distributed constraint optimization. In: International Workshop on Distributed Constraint Reasoning (DCR), pp. 160\u2013164 (2009)","key":"44_CR20"},{"unstructured":"Maheswaran, R., Pearce, J., Tambe, M.: Distributed algorithms for DCOP: a graphical game-based approach. In: Proceedings of the Conference on Parallel and Distributed Computing Systems (PDCS), pp. 432\u2013439 (2004)","key":"44_CR21"},{"unstructured":"Maheswaran, R., Tambe, M., Bowring, E., Pearce, J., Varakantham, P.: Taking DCOP to the real world: efficient complete solutions for distributed event scheduling. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 310\u2013317 (2004)","key":"44_CR22"},{"unstructured":"Miller, S., Ramchurn, S., Rogers, A.: Optimal decentralised dispatch of embedded generation in the smart grid. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 281\u2013288 (2012)","key":"44_CR23"},{"issue":"1\u20132","key":"44_CR24","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.artint.2004.09.003","volume":"161","author":"P Modi","year":"2005","unstructured":"Modi, P., Shen, W.M., Tambe, M., Yokoo, M.: ADOPT: asynchronous distributed constraint optimization with quality guarantees. Artif. Intell. 161(1\u20132), 149\u2013180 (2005)","journal-title":"Artif. Intell."},{"unstructured":"Nguyen, D.T., Yeoh, W., Lau, H.C.: Distributed Gibbs: a memory-bounded sampling-based DCOP algorithm. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 167\u2013174 (2013)","key":"44_CR25"},{"key":"44_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1007\/978-3-642-23786-7_50","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"T Okimoto","year":"2011","unstructured":"Okimoto, T., Joe, Y., Iwasaki, A., Yokoo, M., Faltings, B.: Pseudo-tree-based incomplete algorithm for distributed constraint optimization with quality bounds. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 660\u2013674. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23786-7_50"},{"doi-asserted-by":"crossref","unstructured":"Ottens, B., Dimitrakakis, C., Faltings, B.: DUCT: an upper confidence bound approach to distributed constraint optimization problems. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 528\u2013534 (2012)","key":"44_CR27","DOI":"10.1609\/aaai.v26i1.8129"},{"unstructured":"Pearce, J., Tambe, M.: Quality guarantees on k-optimal solutions for distributed constraint optimization problems. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 1446\u20131451 (2007)","key":"44_CR28"},{"key":"44_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1007\/11564751_68","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"A Petcu","year":"2005","unstructured":"Petcu, A., Faltings, B.: Approximations in distributed optimization. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 802\u2013806. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564751_68"},{"doi-asserted-by":"crossref","unstructured":"Petcu, A., Faltings, B.: A scalable method for multiagent constraint optimization. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 1413\u20131420 (2005)","key":"44_CR30","DOI":"10.1007\/11600930_71"},{"doi-asserted-by":"crossref","unstructured":"Petcu, A., Faltings, B.: A hybrid of inference and local search for distributed combinatorial optimization. In: Proceedings of the International Conference on Intelligent Agent Technology (IAT), pp. 342\u2013348 (2007)","key":"44_CR31","DOI":"10.1109\/IAT.2007.12"},{"issue":"2","key":"44_CR32","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.: Bounded approximate decentralised coordination via the max-sum algorithm. Artif. Intell. 175(2), 730\u2013759 (2011)","journal-title":"Artif. Intell."},{"key":"44_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/978-3-642-33558-7_45","volume-title":"Principles and Practice of Constraint Programming","author":"E Rollon","year":"2012","unstructured":"Rollon, E., Larrosa, J.: Improved bounded max-sum for distributed constraint optimization. In: Milano, M. (ed.) CP 2012. LNCS, pp. 624\u2013632. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33558-7_45"},{"unstructured":"Rust, P., Picard, G., Ramparany, F.: Using message-passing dcop algorithms to solve energy-efficient smart environment configuration problems. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 468\u2013474 (2016)","key":"44_CR34"},{"key":"44_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming \u2014 CP 1998","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49481-2_30"},{"unstructured":"Sultanik, E., Modi, P.J., Regli, W.C.: On modeling multiagent task scheduling as a distributed constraint optimization problem. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 1531\u20131536 (2007)","key":"44_CR36"},{"doi-asserted-by":"crossref","unstructured":"Ueda, S., Iwasaki, A., Yokoo, M.: Coalition structure generation based on distributed constraint optimization. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 197\u2013203 (2010)","key":"44_CR37","DOI":"10.1609\/aaai.v24i1.7552"},{"unstructured":"Vinyals, M., et al.: Quality guarantees for region optimal DCOP algorithms. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 133\u2013140 (2011)","key":"44_CR38"},{"key":"44_CR39","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.: BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm. J. Artif. Intell. Res. 38, 85\u2013133 (2010)","journal-title":"J. Artif. Intell. Res."},{"unstructured":"Yeoh, W., Sun, X., Koenig, S.: Trading off solution quality for faster computation in DCOP search algorithms. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 354\u2013360 (2009)","key":"44_CR40"},{"issue":"3","key":"44_CR41","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1609\/aimag.v33i3.2429","volume":"33","author":"W Yeoh","year":"2012","unstructured":"Yeoh, W., Yokoo, M.: Distributed problem solving. AI Mag. 33(3), 53\u201365 (2012)","journal-title":"AI Mag."},{"issue":"1\u20132","key":"44_CR42","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., Wittenberg, L.: Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks. Artif. Intell. 161(1\u20132), 55\u201387 (2005)","journal-title":"Artif. Intell."},{"issue":"3","key":"44_CR43","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10458-014-9255-3","volume":"29","author":"R Zivan","year":"2015","unstructured":"Zivan, R., Yedidsion, H., Okamoto, S., Glinton, R., Sycara, K.: Distributed constraint optimization for teams of mobile sensing agents. J. Auton. Agents Multi Agent Syst. 29(3), 495\u2013536 (2015)","journal-title":"J. Auton. Agents Multi Agent Syst."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98334-9_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T13:27:49Z","timestamp":1751808469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98334-9_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319983332","9783319983349"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98334-9_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"23 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cp2018.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"114","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3,85","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3,75","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}