{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:03:34Z","timestamp":1742972614266,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046507"},{"type":"electronic","value":"9783030046514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_24","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"357-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Super-Stability in the Student-Project Allocation Problem with Ties"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8003-7887","authenticated-orcid":false,"given":"Sofiat","family":"Olaosebikan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6754-7308","authenticated-orcid":false,"given":"David","family":"Manlove","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"issue":"1","key":"24_CR1","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. Discret. Algorithms 5(1), 79\u201391 (2007)","journal-title":"J. Discret. Algorithms"},{"key":"24_CR2","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 2009: the 2nd International Conference on Computer and Electrical Engineering, pp. 375\u2013379. IEEE (2009)","DOI":"10.1109\/ICCEE.2009.63"},{"issue":"3","key":"24_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.S.: Student project allocation using integer programming. IEEE Trans. Educ. 46(3), 359\u2013367 (2003)","journal-title":"IEEE Trans. Educ."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.ece.2017.06.002","volume":"20","author":"R Calvo-Serrano","year":"2017","unstructured":"Calvo-Serrano, R., Guill\u00e9n-Gos\u00e1lbez, G., Kohn, S., Masters, A.: Mathematical programming approach for optimally allocating students\u2019 projects to academics in large cohorts. Educ. Chem. Eng. 20, 11\u201321 (2017)","journal-title":"Educ. Chem. Eng."},{"key":"24_CR5","doi-asserted-by":"publisher","unstructured":"Chiarandini, M., Fagerberg, R., Gualandi, S.: Handling preferences in student-project allocation. Ann. Oper. Res. (2017). https:\/\/doi.org\/10.1007\/s10479-017-2710-1","DOI":"10.1007\/s10479-017-2710-1"},{"key":"24_CR6","unstructured":"Cooper, F., Manlove, D.F.: A 3\/2-approximation algorithm for the student-project allocation problem. In: Proceedings of SEA 2018. LIPIcs, vol. 103 pp. 8:1\u20138:13 (2018)"},{"key":"24_CR7","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.: A genetic algorithm for the project assignment problem. Comput. Oper. Res. 32, 1255\u20131265 (2005)","journal-title":"Comput. Oper. Res."},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"RW Irving","year":"1994","unstructured":"Irving, R.W.: Stable marriage and indifference. Discret. Appl. Math. 48, 261\u2013272 (1994)","journal-title":"Discret. Appl. Math."},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-44985-X_24","volume-title":"Algorithm Theory - SWAT 2000","author":"RW Irving","year":"2000","unstructured":"Irving, R.W., Manlove, D.F., Scott, S.: The hospitals\/residents problem with ties. SWAT 2000. LNCS, vol. 1851, pp. 259\u2013271. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44985-X_24"},{"key":"24_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"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/3-540-48523-6_41","volume-title":"Automata, Languages and Programming","author":"K Iwama","year":"1999","unstructured":"Iwama, K., Miyazaki, S., Morita, Y., Manlove, D.: Stable marriage with incomplete lists and ties. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 443\u2013452. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48523-6_41"},{"key":"24_CR12","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. Discret. Algorithms 13, 59\u201366 (2012)","journal-title":"J. Discret. Algorithms"},{"key":"24_CR13","unstructured":"Kazakov, D.: Co-ordination of student-project allocation. Manuscript, University of York, Department of Computer Science (2001). http:\/\/www-users.cs.york.ac.uk\/kazakov\/papers\/proj.pdf. Accessed 8 Mar 2018"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-19315-1_19","volume-title":"Combinatorial Algorithms","author":"A Kwanashie","year":"2015","unstructured":"Kwanashie, A., Irving, R.W., Manlove, D.F., Sng, C.T.S.: Profile-based optimal matchings in the student\/project allocation problem. In: Kratochv\u00edl, J., Miller, M., Froncek, D. (eds.) IWOCA 2014. LNCS, vol. 8986, pp. 213\u2013225. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19315-1_19"},{"key":"24_CR15","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)"},{"issue":"1\u20132","key":"24_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"DF Manlove","year":"2002","unstructured":"Manlove, D.F., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theor. Comput. Sci. 276(1\u20132), 261\u2013279 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-96151-4_27","volume-title":"Combinatorial Optimization","author":"D Manlove","year":"2018","unstructured":"Manlove, D., Milne, D., Olaosebikan, S.: An integer programming approach to\u00a0the student-project allocation problem with preferences over projects. In: Lee, J., Rinaldi, G., Mahjoub, A.R. (eds.) ISCO 2018. LNCS, vol. 10856, pp. 313\u2013325. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96151-4_27"},{"key":"24_CR18","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. Discret. Algorithms 6, 553\u2013560 (2008)","journal-title":"J. Discret. Algorithms"},{"key":"24_CR19","unstructured":"Olaosebikan, S., Manlove, D.F.: Super-stability in the student-project allocation problem with ties. http:\/\/arxiv.org\/abs\/1805.09887"},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1002\/rsa.3240050307","volume":"5","author":"BG Pittel","year":"1994","unstructured":"Pittel, B.G., Irving, R.W.: An upper bound for the solvability probability of a random stable roommates instance. Random Struct. Algorithms 5, 465\u2013486 (1994)","journal-title":"Random Struct. Algorithms"},{"issue":"6","key":"24_CR21","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"AE Roth","year":"1984","unstructured":"Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. J. Polit. Econ. 92(6), 991\u20131016 (1984)","journal-title":"J. Polit. Econ."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:49:33Z","timestamp":1710344973000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}