{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:50:15Z","timestamp":1742975415368,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031080104"},{"type":"electronic","value":"9783031080111"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08011-1_28","type":"book-chapter","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T16:16:42Z","timestamp":1654791402000},"page":"424-440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Model-Based Approaches to\u00a0Multi-attribute Diverse Matching"],"prefix":"10.1007","author":[{"given":"Jiachen","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Giovanni","family":"Lo Bianco","sequence":"additional","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadi, S., Ahmed, F., Dickerson, J.P., Fuge, M., Khuller, S.: An algorithm for multi-attribute diverse matching. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI), pp. 3\u20139. AAAI Press (2020)","DOI":"10.24963\/ijcai.2020\/1"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed, F., Dickerson, J.P., Fuge, M.: Diverse weighted bipartite b-matching. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), pp. 35\u201341. AAAI Press (2017)","DOI":"10.24963\/ijcai.2017\/6"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"48","DOI":"10.3389\/fphy.2019.00048","volume":"7","author":"M Aramon","year":"2019","unstructured":"Aramon, M., Rosenberg, G., Valiante, E., Miyazawa, T., Tamura, H., Katzgraber, H.G.: Physics-inspired optimization for quadratic unconstrained problems using a digital annealer. Front. Phys. 7, 48 (2019)","journal-title":"Front. Phys."},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-030-58112-1_22","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"M Bagherbeik","year":"2020","unstructured":"Bagherbeik, M., Ashtari, P., Mousavi, S.F., Kanda, K., Tamura, H., Sheikholeslami, A.: A permutational Boltzmann machine with parallel tempering for solving combinatorial optimization problems. In: B\u00e4ck, T., Preuss, M., Deutz, A., Wang, H., Doerr, C., Emmerich, M., Trautmann, H. (eds.) PPSN 2020. LNCS, vol. 12269, pp. 317\u2013331. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_22"},{"key":"28_CR5","unstructured":"Benabbou, N., Chakraborty, M., Ho, X.V., Sliwinski, J., Zick, Y.: Diversity constraints in public housing allocation. In: 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018 (2018)"},{"issue":"5","key":"28_CR6","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1097\/TP.0000000000003017","volume":"104","author":"D Bertsimas","year":"2020","unstructured":"Bertsimas, D., Papalexopoulos, T., Trichakis, N., Wang, Y., Hirose, R., Vagefi, P.A.: Balancing efficiency and fairness in liver transplant access: tradeoff curves for the assessment of organ distribution policies. Transplantation 104(5), 981\u2013987 (2020)","journal-title":"Transplantation"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Carbonell, J., Goldstein, J.: The use of MMR, diversity-based reranking for reordering documents and producing summaries. In: Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 335\u2013336 (1998)","DOI":"10.1145\/290941.291025"},{"issue":"6","key":"28_CR8","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1109\/TKDE.2016.2527003","volume":"28","author":"C Chen","year":"2016","unstructured":"Chen, C., Zheng, L., Srinivasan, V., Thomo, A., Wu, K., Sukow, A.: Conflict-aware weighted bipartite b-matching and its application to e-commerce. IEEE Trans. Knowl. Data Eng. 28(6), 1475\u20131488 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-030-19212-9_11","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"C Coffrin","year":"2019","unstructured":"Coffrin, C., Nagarajan, H., Bent, R.: Evaluating ising processing units with integer programming. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 163\u2013181. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_11"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-030-58942-4_9","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"E Cohen","year":"2020","unstructured":"Cohen, E., Senderovich, A., Beck, J.C.: An ising framework for constrained clustering on special purpose hardware. In: Hebrard, E., Musliu, N. (eds.) CPAIOR 2020. LNCS, vol. 12296, pp. 130\u2013147. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58942-4_9"},{"key":"28_CR11","unstructured":"D-Wave System Inc.: D-wave tabu (2021). https:\/\/docs.ocean.dwavesys.com\/projects\/tabu\/en\/latest\/, Accessed 21 July 2021"},{"issue":"7","key":"28_CR12","doi-asserted-by":"publisher","first-page":"1681","DOI":"10.1109\/TPDS.2020.2972359","volume":"31","author":"K Dabiri","year":"2020","unstructured":"Dabiri, K., Malekmohammadi, M., Sheikholeslami, A., Tamura, H.: Replica exchange MCMC hardware with automatic temperature selection and parallel trial. IEEE Trans. Parallel Distrib. Syst. 31(7), 1681\u20131692 (2020)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"28_CR13","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1287\/ijoc.2017.0798","volume":"30","author":"I Dunning","year":"2018","unstructured":"Dunning, I., Gupta, S., Silberholz, J.: What works best when? A systematic evaluation of heuristics for Max-Cut and QUBO. INFORMS J. Comput. 30(3), 608\u2013624 (2018)","journal-title":"INFORMS J. Comput."},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Fazliu, Z.L., Chiasserini, C.F., Malandrino, F., Nordio, A.: Graph-based model for beam management in mmwave vehicular networks. In: Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, pp. 363\u2013367 (2020)","DOI":"10.1145\/3397166.3413469"},{"key":"28_CR15","unstructured":"Fern, X.Z., Brodley, C.E., et al.: Cluster ensembles for high dimensional clustering: an empirical study. Technical Report CS06-30-02, Oregon State University (2006)"},{"key":"28_CR16","unstructured":"Fujitsu Limited: The third generation of the digital annealer (2021). https:\/\/www.fujitsu.com\/jp\/group\/labs\/en\/documents\/about\/resources\/tech\/techintro\/3rd-g-da_en.pdf, Accessed 20 Aug 2021"},{"key":"28_CR17","unstructured":"de Givry, S., Schiex, T., Schutt, A., Simonis, H.: Modelling the conference paper assignment problem. In: 19th Workshop on Constraint Modeling and Reformulation, ModRef-20 (2020)"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-030-78230-6_27","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"S Kad\u0131o\u011flu","year":"2021","unstructured":"Kad\u0131o\u011flu, S., Kleynhans, B., Wang, X.: Optimized item selection to boost exploration for recommender systems. In: Stuckey, P.J. (ed.) CPAIOR 2021. LNCS, vol. 12735, pp. 427\u2013445. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78230-6_27"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Karimzadehgan, M., Zhai, C.: Constrained multi-aspect expertise matching for committee review assignment. In: Proceedings of the 18th ACM conference on Information and knowledge management, pp. 1697\u20131700 (2009)","DOI":"10.1145\/1645953.1646207"},{"issue":"1","key":"28_CR20","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger, G., et al.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1), 58\u201381 (2014). https:\/\/doi.org\/10.1007\/s10878-014-9734-0","journal-title":"J. Comb. Optim."},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Kulesza, A., Taskar, B.: Determinantal point processes for machine learning. arXiv preprint arXiv:1207.6083 (2012)","DOI":"10.1561\/9781601986290"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Matsubara, S., et al.: Digital annealer for high-speed solving of combinatorial optimization problems and its applications. In: 2020 25th Asia and South Pacific Design Automation Conference, ASP-DAC, pp. 667\u2013672. IEEE (2020)","DOI":"10.1109\/ASP-DAC47756.2020.9045100"},{"issue":"7644","key":"28_CR23","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1038\/543171a","volume":"543","author":"M Mohseni","year":"2017","unstructured":"Mohseni, M., et al.: Commercialize quantum technologies in five years. Nature News 543(7644), 171 (2017)","journal-title":"Nature News"},{"issue":"1","key":"28_CR24","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/B:ANOR.0000039522.58036.68","volume":"131","author":"G Palubeckis","year":"2004","unstructured":"Palubeckis, G.: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem. Ann. Oper. Res. 131(1), 259\u2013282 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"28_CR25","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1109\/JSTSP.2016.2574703","volume":"10","author":"G Rosenberg","year":"2016","unstructured":"Rosenberg, G., Haghnegahdar, P., Goddard, P., Carr, P., Wu, K., De Prado, M.L.: Solving the optimal trading trajectory problem using a quantum annealer. IEEE J. Sel. Top. Signal Process. 10(6), 1053\u20131060 (2016)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"28_CR26","unstructured":"Tran, T.T., et al.: Explorations of quantum-classical approaches to scheduling a mars lander activity problem. In: Workshops at the Thirtieth AAAI Conference on Artificial Intelligence (2016)"},{"key":"28_CR27","unstructured":"Zhang, J., Lo Bianco, G., Beck, J.C.: MDWBM Instances (2021). https:\/\/github.com\/JasonZhangjc\/mdwbm-instances, Accessed 11 Feb 2022"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08011-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T13:06:12Z","timestamp":1667912772000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08011-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031080104","9783031080111"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08011-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Los Angeles, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/usc.edu\/cpaior-2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - 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 (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}