{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T12:31:30Z","timestamp":1776083490870,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,11,18]],"date-time":"2017-11-18T00:00:00Z","timestamp":1510963200000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10479-017-2710-1","type":"journal-article","created":{"date-parts":[[2017,11,18]],"date-time":"2017-11-18T11:13:49Z","timestamp":1511003629000},"page":"39-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Handling preferences in student-project allocation"],"prefix":"10.1007","volume":"275","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6136-8496","authenticated-orcid":false,"given":"Marco","family":"Chiarandini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1004-3314","authenticated-orcid":false,"given":"Rolf","family":"Fagerberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2111-3528","authenticated-orcid":false,"given":"Stefano","family":"Gualandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,18]]},"reference":[{"issue":"5","key":"2710_CR1","doi-asserted-by":"publisher","first-page":"1954","DOI":"10.1257\/aer.99.5.1954","volume":"99","author":"A Abdulkadirolu","year":"2009","unstructured":"Abdulkadirolu, A., Pathak, P. A., & Roth, A. E. (2009). Strategy-proofness versus efficiency in matching with indifferences: Redesigning the NYC high school match. American Economic Review, 99(5), 1954\u201378. https:\/\/doi.org\/10.1257\/aer.99.5.1954 .","journal-title":"American Economic Review"},{"issue":"1","key":"2710_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. (2007). Two algorithms for the student-project allocation problem. Journal of Discrete Algorithms, 5(1), 73\u201390. https:\/\/doi.org\/10.1016\/j.jda.2006.03.006 .","journal-title":"Journal of Discrete Algorithms"},{"issue":"3","key":"2710_CR3","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1109\/TE.2003.811038","volume":"46","author":"AA Anwar","year":"2003","unstructured":"Anwar, A. A., & Bahaj, A. (2003). Student project allocation using integer programming. IEEE Transactions on Education, 46(3), 359\u2013367. https:\/\/doi.org\/10.1109\/TE.2003.811038 .","journal-title":"IEEE Transactions on Education"},{"key":"2710_CR4","unstructured":"Arulselvan, A., Cseh, \u00c1., Gro\u00df, M., Manlove, D.F., & Matuschke, J. (2016). Matchings with lower quotas: Algorithms and complexity. CoRR arXiv:1412.0325 . Preliminary version appeared at ISAAC 2015."},{"key":"2710_CR5","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., & Shi, P. (2014). Improving community cohesion in school choice via correlated-lottery implementation. Working paper.","DOI":"10.1287\/opre.2014.1319"},{"issue":"3","key":"2710_CR6","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0022-0531(70)90039-6","volume":"2","author":"AB Atkinson","year":"1970","unstructured":"Atkinson, A. B. (1970). On the measurement of inequality. Journal of Economic Theory, 2(3), 244\u2013263.","journal-title":"Journal of Economic Theory"},{"issue":"12","key":"2710_CR7","doi-asserted-by":"publisher","first-page":"2234","DOI":"10.1287\/mnsc.1120.1549","volume":"58","author":"D Bertsimas","year":"2012","unstructured":"Bertsimas, D., Farias, V. F., & Trichakis, N. (2012). On the efficiency-fairness trade-off. Management Science, 58(12), 2234\u20132250. https:\/\/doi.org\/10.1287\/mnsc.1120.1549 .","journal-title":"Management Science"},{"issue":"34","key":"2710_CR8","doi-asserted-by":"publisher","first-page":"3136","DOI":"10.1016\/j.tcs.2010.05.005","volume":"411","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., Fleiner, T., Irving, R. W., & Manlove, D. F. (2010). The college admissions problem with lower and common quotas. Theoretical Computer Science, 411(34), 3136\u20133153. https:\/\/doi.org\/10.1016\/j.tcs.2010.05.005 .","journal-title":"Theoretical Computer Science"},{"issue":"Part 1","key":"2710_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.dam.2011.11.003","volume":"164","author":"P Bir\u00f3","year":"2014","unstructured":"Bir\u00f3, P., & McDermid, E. (2014). Matching with sizes (or scheduling with processing set restrictions). Discrete Applied Mathematics, 164(Part 1), 61\u201367. https:\/\/doi.org\/10.1016\/j.dam.2011.11.003 .","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"2710_CR10","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1006\/jeth.2000.2710","volume":"100","author":"A Bogomolnaia","year":"2001","unstructured":"Bogomolnaia, A., & Moulin, H. (2001). A new solution to the random assignment problem. Journal of Economic Theory, 100(2), 295\u2013328. https:\/\/doi.org\/10.1006\/jeth.2000.2710 .","journal-title":"Journal of Economic Theory"},{"key":"2710_CR11","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1613\/jair.2467","volume":"32","author":"S Bouveret","year":"2008","unstructured":"Bouveret, S., & Lang, J. (2008). Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity. Journal of Artificial Intelligence Research, 32, 525\u2013564. https:\/\/doi.org\/10.1613\/jair.2467 .","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2710_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair division: From cake-cutting to dispute resolution","author":"SJ Brams","year":"1996","unstructured":"Brams, S. J., & Taylor, A. D. (1996). Fair division: From cake-cutting to dispute resolution. Cambridge: Cambridge University Press."},{"issue":"6","key":"2710_CR13","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"E Budish","year":"2011","unstructured":"Budish, E. (2011). The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy, 119(6), 1061\u20131103. https:\/\/doi.org\/10.1086\/664613 .","journal-title":"Journal of Political Economy"},{"issue":"5","key":"2710_CR14","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1257\/aer.102.5.2237","volume":"102","author":"E Budish","year":"2012","unstructured":"Budish, E., & Cantillon, E. (2012). The multi-unit assignment problem: Theory and evidence from course allocation at Harvard. American Economic Review, 102(5), 2237\u201371. https:\/\/doi.org\/10.1257\/aer.102.5.2237 .","journal-title":"American Economic Review"},{"key":"2710_CR15","unstructured":"Dye, J. (2001). A constraint logic programming approach to the stable marriage problem and its application to student-project allocation. In Proceedings of the sixth international workshop on computer-aided software engineering."},{"key":"2710_CR16","doi-asserted-by":"publisher","unstructured":"El-Atta, A., & Moussa, M.I. (2009). Student project allocation with preference lists over (student, project) pairs. In Second international conference on computer and electrical engineering, 2009. ICCEE \u201909 (Vol.\u00a01, pp. 375\u2013379). https:\/\/doi.org\/10.1109\/ICCEE.2009.63 .","DOI":"10.1109\/ICCEE.2009.63"},{"key":"2710_CR17","unstructured":"Fragiadakis, D. E., & Troyan, P. (2014). Improving welfare in assignment problems: An experimental investigation. http:\/\/erl.tamu.edu\/working-papers\/ . Working paper at Economic Research Laboratory, Texas A&M University."},{"issue":"1","key":"2710_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00453-009-9386-0","volume":"58","author":"N Garg","year":"2010","unstructured":"Garg, N., Kavitha, T., Kumar, A., Mehlhorn, K., & Mestre, J. (2010). Assigning papers to referees. Algorithmica, 58(1), 119\u2013136. https:\/\/doi.org\/10.1007\/s00453-009-9386-0 .","journal-title":"Algorithmica"},{"issue":"1","key":"2710_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.seps.2009.03.001","volume":"44","author":"MJ Geiger","year":"2010","unstructured":"Geiger, M. J., & Wenger, W. (2010). On the assignment of students to topics: A variable neighborhood search approach. Socio-Economic Planning Sciences, 44(1), 25\u201334. https:\/\/doi.org\/10.1016\/j.seps.2009.03.001 .","journal-title":"Socio-Economic Planning Sciences"},{"key":"2710_CR20","volume-title":"The stable marriage problem: Structure and algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield, D., & Irving, R. (1989). The stable marriage problem: Structure and algorithms. Cambridge: MIT Press."},{"issue":"5","key":"2710_CR21","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1016\/j.cor.2003.11.003","volume":"32","author":"PR Harper","year":"2005","unstructured":"Harper, P. R., de Senna, V., Vieira, I. T., & Shahani, A. K. (2005). A genetic algorithm for the project assignment problem. Computers & Operations Research, 32(5), 1255\u20131265. https:\/\/doi.org\/10.1016\/j.cor.2003.11.003 .","journal-title":"Computers & Operations Research"},{"issue":"9","key":"2710_CR22","doi-asserted-by":"publisher","first-page":"1682","DOI":"10.1287\/mnsc.1120.1515","volume":"58","author":"JN Hooker","year":"2012","unstructured":"Hooker, J. N., & Williams, H. P. (2012). Combining equity and utilitarianism in a mathematical programming model. Management Science, 58(9), 1682\u20131693. https:\/\/doi.org\/10.1287\/mnsc.1120.1515 .","journal-title":"Management Science"},{"key":"2710_CR23","doi-asserted-by":"publisher","unstructured":"Iwama, K., & Miyazaki, S. (2008). A survey of the stable marriage problem and its variants. In International conference on informatics education and research for knowledge-circulating society (ICKS 2008) (pp. 131\u2013136). https:\/\/doi.org\/10.1109\/ICKS.2008.7 .","DOI":"10.1109\/ICKS.2008.7"},{"key":"2710_CR24","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. (2012). Improved approximation bounds for the student-project allocation problem with preferences over projects. Journal of Discrete Algorithms, 13, 59\u201366. https:\/\/doi.org\/10.1016\/j.jda.2012.02.001 .","journal-title":"Journal of Discrete Algorithms"},{"key":"2710_CR25","volume-title":"The handbook of experimental economics","year":"1997","unstructured":"Kagel, J. H., & Roth, A. E. (Eds.). (1997). The handbook of experimental economics. Princeton: Princeton University Press."},{"key":"2710_CR26","doi-asserted-by":"publisher","unstructured":"Lu, T., & Boutilier, C.E. (2012). Matching models for preference-sensitive group purchasing. In Proceedings of the 13th ACM conference on electronic commerce, EC \u201912 (pp. 723\u2013740). ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/2229012.2229068 .","DOI":"10.1145\/2229012.2229068"},{"key":"2710_CR27","doi-asserted-by":"publisher","DOI":"10.1142\/8591","volume-title":"Algorithmics of matching under preferences. Series on theoretical computer science","author":"DF Manlove","year":"2013","unstructured":"Manlove, D. F. (2013). Algorithmics of matching under preferences. Series on theoretical computer science (Vol. 2). Singapore: World Scientific."},{"issue":"4","key":"2710_CR28","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. (2008). Student-project allocation with preferences over projects. Journal of Discrete Algorithms, 6(4), 553\u2013560. https:\/\/doi.org\/10.1016\/j.jda.2008.07.003 .","journal-title":"Journal of Discrete Algorithms"},{"key":"2710_CR29","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2954.001.0001","volume-title":"Fair division and collective welfare","author":"H Moulin","year":"2003","unstructured":"Moulin, H. (2003). Fair division and collective welfare. Cambridge: The MIT Press."},{"key":"2710_CR30","doi-asserted-by":"crossref","first-page":"43","DOI":"10.26636\/jtit.2005.3.326","volume":"3","author":"W Ogryczak","year":"2005","unstructured":"Ogryczak, W., Pi\u00f3ro, M., & Tomaszewski, A. (2005). Telecommunications network design and max\u2013min optimization problem. Journal of Telecommunications and Information Technology, 3, 43\u201356.","journal-title":"Journal of Telecommunications and Information Technology"},{"issue":"3","key":"2710_CR31","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00182-007-0083-4","volume":"36","author":"N Perach","year":"2008","unstructured":"Perach, N., Polak, J., & Rothblum, U. G. (2008). A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the technion. International Journal of Game Theory, 36(3), 519\u2013535. https:\/\/doi.org\/10.1007\/s00182-007-0083-4 .","journal-title":"International Journal of Game Theory"},{"issue":"2","key":"2710_CR32","doi-asserted-by":"publisher","first-page":"195","DOI":"10.2307\/3008267","volume":"23","author":"LG Proll","year":"1972","unstructured":"Proll, L. G. (1972). A simple method of assigning projects to students. Operational Research Quarterly (1970\u20131977), 23(2), 195\u2013201.","journal-title":"Operational Research Quarterly (1970\u20131977)"},{"key":"2710_CR33","doi-asserted-by":"crossref","DOI":"10.4159\/9780674042605","volume-title":"A theory of justice","author":"J Rawls","year":"1971","unstructured":"Rawls, J. (1971). A theory of justice. Cambridge, MA: Harvard University Press."},{"issue":"6","key":"2710_CR34","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"AE Roth","year":"1984","unstructured":"Roth, A. E. (1984). The evolution of the labor market for medical interns and residents: A case study in game theory. Journal of Political Economy, 92(6), 991\u20131016.","journal-title":"Journal of Political Economy"},{"issue":"4","key":"2710_CR35","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1109\/TE.2007.912537","volume":"51","author":"D Srinivasan","year":"2008","unstructured":"Srinivasan, D., & Rachmawati, L. (2008). Efficient fuzzy evolutionary algorithm-based approach for solving the student project allocation problem. IEEE Transactions on Education, 51(4), 439\u2013447. https:\/\/doi.org\/10.1109\/TE.2007.912537 .","journal-title":"IEEE Transactions on Education"},{"key":"2710_CR36","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195078602.001.0001","volume-title":"Inequality","author":"L Tempkin","year":"1993","unstructured":"Tempkin, L. (1993). Inequality. New York: Oxford University Press."},{"issue":"1","key":"2710_CR37","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/13.660783","volume":"41","author":"C Teo","year":"1998","unstructured":"Teo, C., & Ho, D. J. (1998). A systematic approach to the implementation of final year project in an electrical engineering undergraduate course. IEEE Transactions on Education, 41(1), 25\u201330. https:\/\/doi.org\/10.1109\/13.660783 .","journal-title":"IEEE Transactions on Education"},{"key":"2710_CR38","volume-title":"Model building in mathematical programming","author":"HP Williams","year":"2013","unstructured":"Williams, H. P. (2013). Model building in mathematical programming (5th ed.). Chichester: Wiley.","edition":"5"},{"issue":"1","key":"2710_CR39","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0165-0114(95)00242-1","volume":"81","author":"RR Yager","year":"1996","unstructured":"Yager, R. R. (1996). Constrained OWA aggregation. Fuzzy Sets and Systems, 81(1), 89\u2013101. https:\/\/doi.org\/10.1016\/0165-0114(95)00242-1 .","journal-title":"Fuzzy Sets and Systems"},{"issue":"1","key":"2710_CR40","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/S0377-2217(96)00217-2","volume":"102","author":"RR Yager","year":"1997","unstructured":"Yager, R. R. (1997). On the analytic representation of the leximin ordering and its application to flexible constraint propagation. European Journal of Operational Research, 102(1), 176\u2013192. https:\/\/doi.org\/10.1016\/S0377-2217(96)00217-2 .","journal-title":"European Journal of Operational Research"},{"key":"2710_CR41","doi-asserted-by":"crossref","DOI":"10.1515\/9780691214054","volume-title":"Equity: In theory and practice","author":"P Young","year":"1995","unstructured":"Young, P. (1995). Equity: In theory and practice. Princeton, NJ: Princeton University Press."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2710-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2710-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2710-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T04:34:34Z","timestamp":1750998874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2710-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,18]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["2710"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2710-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,18]]},"assertion":[{"value":"18 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}