{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T21:37:51Z","timestamp":1780090671074,"version":"3.54.0"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319070001","type":"print"},{"value":"9783319070018","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-07001-8_36","type":"book-chapter","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T15:13:03Z","timestamp":1404918783000},"page":"263-269","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["An Integer Programming Approach to the Hospitals\/Residents Problem with Ties"],"prefix":"10.1007","author":[{"given":"Augustine","family":"Kwanashie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David F.","family":"Manlove","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,7,10]]},"reference":[{"key":"36_CR1","unstructured":"National Resident Matching Program website. http:\/\/www.nrmp.org."},{"key":"36_CR2","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. (1994). Stable marriage and indifference. Discrete Applied Mathematics, 48, 261\u2013272.","journal-title":"Discrete Applied Mathematics"},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., & Shapley, L. S. (1962). College admissions and the stability of marriage. American Mathematical Monthly, 69, 9\u201315.","journal-title":"American Mathematical Monthly"},{"issue":"1\u20132","key":"36_CR4","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. (2002). Hard variants of stable marriage. Theoretical Computer Science, 276(1\u20132), 261\u2013279.","journal-title":"Theoretical Computer Science"},{"key":"36_CR5","unstructured":"Kir\u00e1ly, Z. (2012). Linear time local approximation algorithm for maximum stable marriage. In Proceedings of MATCH-UP, Vol. 12, pp. 99\u2013110."},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"McDermid, E. (2009). A 3\/2 approximation algorithm for general stable marriage. In Proceedings of ICALP 09. LNCS (Vol. 5555, pp. 689\u2013700). Berlin: Springer.","DOI":"10.1007\/978-3-642-02927-1_57"},{"key":"36_CR7","unstructured":"Kwanashie A., Manlove D. F. (2013) An integer programming approach to the hospitals\/residents problem with ties. Technical Report 1308.4064, Computing Research Repository, Cornell University Library."},{"key":"36_CR8","unstructured":"Podhradsk\u1ef3, A. (2011). Stable marriage problem algorithms. Masters thesis, Masaryk University, Faculty of Informatics."},{"key":"36_CR9","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1498698.1537595","volume":"14","author":"RW Irving","year":"2009","unstructured":"Irving, R. W., & Manlove, D. F. (2009). Finding large stable matchings. ACM Journal of Experimental Algorithmics, 14, 2.","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Kir\u00e1ly Z. (2008) Better and simpler approximation algorithms for the stable marriage problem. Algorithms-ESA 2008 (pp. 623\u2013634). Berlin: Springer.","DOI":"10.1007\/978-3-540-87744-8_52"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07001-8_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T06:06:06Z","timestamp":1676873166000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07001-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070001","9783319070018"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07001-8_36","relation":{},"ISSN":["0721-5924"],"issn-type":[{"value":"0721-5924","type":"print"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"10 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}