{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T23:07:54Z","timestamp":1764198474201,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":13,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819549597"},{"type":"electronic","value":"9789819549603"}],"license":[{"start":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T00:00:00Z","timestamp":1764201600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T00:00:00Z","timestamp":1764201600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-4960-3_1","type":"book-chapter","created":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:58:24Z","timestamp":1764133104000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving the\u00a0Student-Project Allocation Problem with\u00a0Preferences over\u00a0Projects Using a\u00a0Multi-start Local Search"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-3580-5777","authenticated-orcid":false,"given":"Le Quoc","family":"Anh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3901-2514","authenticated-orcid":false,"given":"Nguyen Nhu","family":"Son","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4771-7856","authenticated-orcid":false,"given":"Son Thanh","family":"Cao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9389-4570","authenticated-orcid":false,"given":"Hoang Huu","family":"Viet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,27]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Irving, R.W., Manlove, D.F.: The student-project allocation problem. In: Proceedings of the 14th International Symposium on Algorithms and Computation, pp. 474\u2013484. Kyoto, Japan, 15\u201317 December 2003","DOI":"10.1007\/978-3-540-24587-2_49"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jda.2006.03.006","volume":"5","author":"DJ Abraham","year":"2007","unstructured":"Abraham, D.J., Irving, R.W., Manlove, D.F.: Two algorithms for the student-project allocation problem. J. Discrete Algorithms 5(1), 73\u201390 (2007)","journal-title":"J. Discrete Algorithms"},{"key":"1_CR3","unstructured":"Cooper, F., Manlove, D.: A 3\/2-approximation algorithm for the student-project allocation problem. In: Proceedings of the 17th International Symposium on Experimental Algorithms, pp. 8:1\u20138:13. L\u2019Aquila,Italy, June 2018"},{"issue":"1","key":"1_CR4","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."},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.jda.2012.02.001","volume":"13","author":"K Iwama","year":"2012","unstructured":"Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation bounds for the student-project allocation problem with preferences over projects. J. Discrete Algorithms 13(1), 59\u201366 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Kir\u00e1ly, Z.: Better and simpler approximation algorithms for the stable marriage problem. Algorithmica 60(1), 3\u201320 (2011)","DOI":"10.1007\/s00453-009-9371-7"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Manlove, D., Milne, D., Olaosebikan, S.: An integer programming approach to the student-project allocation problem with preferences over projects. In: Proceedings of the 5th International Symposium on Combinatorial Optimization, pp. 313\u2013325. Morocco, April 2018","DOI":"10.1007\/978-3-319-96151-4_27"},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.dam.2020.08.015","volume":"308","author":"D Manlove","year":"2022","unstructured":"Manlove, D., Milne, D., Olaosebikan, S.: Student-project allocation with preferences over projects: algorithmic and experimental results. Discret. Appl. Math. 308(1), 220\u2013234 (2022)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"1_CR9","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.jda.2008.07.003","volume":"6","author":"DF Manlove","year":"2008","unstructured":"Manlove, D.F., O\u2019Malley, G.: Student-project allocation with preferences over projects. J. Discrete Algorithms 6(4), 553\u2013560 (2008)","journal-title":"J. Discrete Algorithms"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artif. Intell. 58(1-3), 161\u2013205 (1992)","DOI":"10.1016\/0004-3702(92)90007-K"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1007\/s10878-020-00632-x","volume":"43","author":"S Olaosebikan","year":"2022","unstructured":"Olaosebikan, S., Manlove, D.: Super-stability in the student-project allocation problem with ties. J. Comb. Optim. 43(1), 1203\u20131239 (2022)","journal-title":"J. Comb. Optim."},{"key":"1_CR12","volume-title":"Artificial Intelligence: A Modern Approach","author":"S Russel","year":"2009","unstructured":"Russel, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Prentice Hall Press, Upper Saddle River, NJ, USA (2009)","edition":"3"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Viet, H.H., Tan, L.V., Cao, S.T.: Finding maximum stable matchings for the student-project allocation problem with preferences over projects. In: Proceedings of the 7th International Conference on Future Data and Security Engineering, pp. 411\u2013422. Quy Nhon, Vietnam, November 2020","DOI":"10.1007\/978-981-33-4370-2_29"}],"container-title":["Lecture Notes in Computer Science","Multi-disciplinary Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4960-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T23:03:31Z","timestamp":1764198211000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4960-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,27]]},"ISBN":["9789819549597","9789819549603"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4960-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,11,27]]},"assertion":[{"value":"27 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIWAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Multi-disciplinary Trends in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ho Chi Minh City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"miwai2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/miwai25.miwai.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}