{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T21:10:39Z","timestamp":1781385039660,"version":"3.54.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319193144","type":"print"},{"value":"9783319193151","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-19315-1_19","type":"book-chapter","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T10:42:08Z","timestamp":1433587328000},"page":"213-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Profile-Based Optimal Matchings in the Student\/Project Allocation Problem"],"prefix":"10.1007","author":[{"given":"Augustine","family":"Kwanashie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert W.","family":"Irving","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David F.","family":"Manlove","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Colin T. S.","family":"Sng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"key":"19_CR1","unstructured":"Abraham, D.J.: Algorithmics of two-sided matching problems. Master\u2019s thesis, University of Glasgow, Department of Computing Science (2003)"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"79","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), 79\u201391 (2007)","journal-title":"J. Discrete Algorithms"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"El-Atta, A.H.A., Moussa, M.I.: Student project allocation with preference lists over (student, project) pairs. In: Proceedings of ICCEE 09: The 2nd International Conference on Computer and Electrical Engineering, pp. 375\u2013379 (2009)","DOI":"10.1109\/ICCEE.2009.63"},{"key":"19_CR4","volume-title":"Flows in Networks","author":"LR Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"19_CR5","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 (1989)"},{"key":"19_CR6","unstructured":"Huang, C.-C., Kavitha, T., Mehlhorn, K., Michail, D.: Fair matchings and related problems. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), vol. 24, pp. 339\u2013350 (2013)"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1086\/260757","volume":"87","author":"A Hylland","year":"1979","unstructured":"Hylland, A., Zeckhauser, R.: The efficient allocation of individuals to positions. J. Polit. Econ. 87(2), 293\u2013314 (1979)","journal-title":"J. Polit. Econ."},{"key":"19_CR8","unstructured":"Irving, R.W.: Greedy matchings. Technical Report TR-2003-136, University of Glasgow, Department of Computing Science (2003)"},{"key":"19_CR9","unstructured":"Irving, R.W.: Greedy and generous matchings via a variant of the Bellman-Ford algorithm (2006) (Unpublished manuscript)"},{"issue":"4","key":"19_CR10","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1145\/1198513.1198520","volume":"2","author":"RW Irving","year":"2006","unstructured":"Irving, R.W., Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: Rank-maximal matchings. ACM Trans. Algorithms 2(4), 602\u2013610 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"19_CR11","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, 59\u201366 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"19_CR12","unstructured":"Kwanashie, A., Irving, R.W., Manlove, D.F., Sng, C.T.S.: Profile-based optimal matchings in the Student\/Project Allocation problem. CoRR Technical Report 1403.0751 (2014). http:\/\/arxiv.org\/abs\/1403.0751"},{"key":"19_CR13","doi-asserted-by":"publisher","DOI":"10.1142\/8591","volume-title":"Algorithmics of Matching Under Preferences","author":"DF Manlove","year":"2013","unstructured":"Manlove, D.F.: Algorithmics of Matching Under Preferences. World Scientific, Singapore (2013)"},{"key":"19_CR14","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, 553\u2013560 (2008)","journal-title":"J. Discrete Algorithms"},{"key":"19_CR15","unstructured":"Mehlhorn, K., Michail, D.: Network problems with non-polynomial weights and applications (2006) (Unpublished manuscript)"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"JB Orlin","year":"1993","unstructured":"Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41(2), 338\u2013350 (1993)","journal-title":"Oper. Res."},{"key":"19_CR17","unstructured":"Sng, C.T.S.: Efficient Algorithms for Bipartite Matching Problems with Preferences. Ph.D. thesis, University of Glasgow, Department of Computing Science (2008)"},{"key":"19_CR18","unstructured":"Zelvyte, M.: The Student-Project Allocation problem: a network flow model. Honours project dissertation, University of Glasgow, School of Mathematics and Statistics (2014)"},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0022-0531(90)90070-Z","volume":"52","author":"L Zhou","year":"1990","unstructured":"Zhou, L.: On a conjecture by Gale about one-sided matching problems. J. Econ. Theor. 52(1), 123\u2013135 (1990)","journal-title":"J. Econ. Theor."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19315-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T09:55:14Z","timestamp":1676454914000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19315-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319193144","9783319193151"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19315-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"7 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}