{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:46:49Z","timestamp":1742989609513,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819983872"},{"type":"electronic","value":"9789819983889"}],"license":[{"start":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T00:00:00Z","timestamp":1701043200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T00:00:00Z","timestamp":1701043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-99-8388-9_36","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T16:02:21Z","timestamp":1701014541000},"page":"442-454","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Maximum Weakly Stable Matchings for\u00a0Hospitals\/Residents with\u00a0Ties Problem via\u00a0Heuristic Search"],"prefix":"10.1007","author":[{"given":"Son Thanh","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le Van","family":"Thanh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoang Huu","family":"Viet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Bir\u00f3, P., Manlove, D.F., McBride, I.: The hospitals\/residents problem with couples: complexity and integer programming models. In: Proceeding of SEA 2014: 13th International Symposium on Experimental Algorithms, Copenhagen, Denmark, pp. 10\u201321 (2014)","DOI":"10.1007\/978-3-319-07959-2_2"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-031-23492-7_29","volume-title":"Artificial Intelligence and Soft Computing","author":"ST Cao","year":"2023","unstructured":"Cao, S.T., Anh, L.Q., Viet, H.H.: A heuristic repair algorithm for the hospitals\/residents problem with ties. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J.M. (eds.) ICAISC 2022. LNCS, vol. 13588, pp. 340\u2013352. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-23492-7_29"},{"issue":"1","key":"36_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"9","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 9(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Local search for stable marriage problems with ties and incomplete lists. In: Proceedings of 11th Pacific Rim International Conference on Artificial Intelligence, Daegu, Korea, pp. 64\u201375 (2010)","DOI":"10.1007\/978-3-642-15246-7_9"},{"issue":"4","key":"36_CR5","doi-asserted-by":"publisher","first-page":"591","DOI":"10.3390\/a6040591","volume":"6","author":"M Gelain","year":"2013","unstructured":"Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Local search approaches in stable matching problems. Algorithms 6(4), 591\u2013617 (2013)","journal-title":"Algorithms"},{"key":"36_CR6","unstructured":"Gent, I.P., Prosser, P.: An empirical study of the stable marriage problem with ties and incomplete lists. In: Proceedings of the 15th European Conference on Artificial Intelligence, Lyon, France, pp. 141\u2013145 (2002)"},{"key":"36_CR7","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press Cambridge, New York (1989)"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"RW Irving","year":"1974","unstructured":"Irving, R.W.: Stable marriage and indifference. Discret. Appl. Math. 48, 261\u2013272 (1974)","journal-title":"Discret. Appl. Math."},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Irving, R.W., Manlove, D.F., Scott, S.: The hospitals\/residents problem with ties. In: Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, pp. 259\u2013271 (2000)","DOI":"10.1007\/3-540-44985-X_24"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/3-540-36494-3_39","volume-title":"STACS 2003","author":"RW Irving","year":"2003","unstructured":"Irving, R.W., Manlove, D.F., Scott, S.: Strong stability in the hospitals\/residents problem. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 439\u2013450. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_39"},{"issue":"1","key":"36_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.3390\/a6030471","volume":"6","author":"Z Kir\u00e1ly","year":"2013","unstructured":"Kir\u00e1ly, Z.: Linear time local approximation algorithm for maximum stable marriage. Algorithms 6(1), 471\u2013484 (2013)","journal-title":"Algorithms"},{"key":"36_CR12","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-319-07001-8_36","volume-title":"Operations Research Proceedings 2013","author":"A Kwanashie","year":"2014","unstructured":"Kwanashie, A., Manlove, D.F.: An integer programming approach to the hospitals\/residents problem with ties. In: Huisman, D., Louwerse, I., Wagelmans, A.P.M. (eds.) Operations Research Proceedings 2013. ORP, pp. 263\u2013269. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07001-8_36"},{"key":"36_CR13","unstructured":"Munera, D., Diaz, D., Abreu, S., Rossi, F., Saraswat, V., Codognet, P.: A local search algorithm for SMTI and its extension to HRT problems. In: Proceedings of the 3rd International Workshop on Matching Under Preferences, pp. 66\u201377. University of Glasgow (2015)"},{"issue":"1","key":"36_CR14","first-page":"1","volume":"14","author":"RW Irving","year":"2009","unstructured":"Irving, R.W., Manlove, D.F.: Finding large stable matchings. J. Exp. Algorithmics 14(1), 1\u20132 (2009)","journal-title":"J. Exp. Algorithmics"}],"container-title":["Lecture Notes in Computer Science","AI 2023: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8388-9_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:56:16Z","timestamp":1710356176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8388-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,27]]},"ISBN":["9789819983872","9789819983889"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8388-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,27]]},"assertion":[{"value":"27 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Joint Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brisbane, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausai2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ajcai2023.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 (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":"213","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":"23","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":"59","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":"11% - 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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}