{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,28]],"date-time":"2025-04-28T05:22:28Z","timestamp":1745817748210,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"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-12691-3_32","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"429-443","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Integer Programming Methods for Special College Admissions Problems"],"prefix":"10.1007","author":[{"given":"P\u00e9ter","family":"Bir\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iain","family":"McBride","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, D., Blum, A., Sandholm, T.: Clearing algorithms for barter-exchange markets: enabling nationwide kidney exchanges. In: Proceedings of ACM-EC (2007)","DOI":"10.1145\/1250910.1250954"},{"key":"32_CR2","unstructured":"http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022053114000301"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Azavedo, E.M., Leshno, J.D.: A supply and demand framework for two-sided matching markets. Working paper (2012)","DOI":"10.2139\/ssrn.2260567"},{"issue":"3, Ser. A","key":"32_CR4","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s101070050004","volume":"87","author":"M Ba\u00efou","year":"2000","unstructured":"Ba\u00efou, M., Balinski, M.: The stable admissions polytope. Math. Program. 87(3, Ser. A), 427\u2013439 (2000)","journal-title":"Math. Program."},{"key":"32_CR5","unstructured":"Bir\u00f3, P.: Student admissions in Hungary as Gale and Shapley envisaged. Technical report, no. TR-2008-291 of the CS Department of Glasgow University (2008)"},{"key":"32_CR6","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.: The college admissions problem with lower and common quotas. Theor. Comput. Sci. 411, 3136\u20133153 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR7","doi-asserted-by":"crossref","first-page":"12:1","DOI":"10.1145\/1963190.1970372","volume":"16","author":"P Bir\u00f3","year":"2011","unstructured":"Bir\u00f3, P., Irving, R.W., Schlotter, I.: Stable matching with couples - an empirical study. ACM J. Exp. Algorithmics 16, 12:1 (2011). (Article No.: 1.2)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Bir\u00f3, P., Kiselgof, S.: College admissions with stable score-limits. Central Eur. J. Oper. Res. (2014, To appear)","DOI":"10.1007\/s10100-013-0320-9"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Bir\u00f3, P., McBride, I.: Integer programming methods for special college admissions problems. Technical report no. 1408.6878, Computing Research Repository, Cornell University Library (2014)","DOI":"10.1007\/978-3-319-12691-3_32"},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-319-07959-2_2","volume-title":"Experimental Algorithms","author":"P Bir\u00f3","year":"2014","unstructured":"Bir\u00f3, P., Manlove, D.F., McBride, I.: The hospitals\/residents problem with couples: complexity and integer programming models. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 10\u201321. Springer, Heidelberg (2014)"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0165-4896(03)00074-X","volume":"46","author":"T Fleiner","year":"2003","unstructured":"Fleiner, T.: On the stable $$b$$-matching polytope. Math. Soc. Sci. 46, 149\u2013158 (2003)","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"32_CR12","doi-asserted-by":"publisher","first-page":"32","DOI":"10.3390\/a7010032","volume":"7","author":"T Fleiner","year":"2014","unstructured":"Fleiner, T., Jank\u00f3, Z.: Choice function-based two-sided markets: stability, lattice property, path independence and algorithms. Algorithms 7(1), 32\u201359 (2014)","journal-title":"Algorithms"},{"issue":"1","key":"32_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Monthly 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Monthly"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/s10878-008-9153-1","volume":"16","author":"RW Irving","year":"2008","unstructured":"Irving, R.W.: Stable matching problems with exchange restrictions. J. Comb. Optim. 16, 344\u2013360 (2008)","journal-title":"J. Comb. Optim."},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10878-007-9133-x","volume":"16","author":"RW Irving","year":"2008","unstructured":"Irving, R.W., Manlove, D.F.: Approximation algorithms for hard variants of the stable marriage and hospitals\/residents problems. J. Comb. Optim. 16, 279\u2013292 (2008)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"32_CR16","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1257\/aer.102.3.366","volume":"102","author":"Y Kamada","year":"2012","unstructured":"Kamada, Y., Kojima, F.: Stability and strategy-proofness for matching with constraints: a problem in the Japanese medical match and its solution. Am. Econ. Rev. (P&P) 102(3), 366\u2013370 (2012)","journal-title":"Am. Econ. Rev. (P&P)"},{"key":"32_CR17","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-319-07001-8_36","volume-title":"Operations Research Proceedings 2013","author":"A Kwanashie","year":"2014","unstructured":"Kwanashie, A., Manlove, D.F.: An integer programming approach to the hospitals\/residents problem with ties. In: Huisman, D., Louwerse, I., Wagelmans, A.P.M. (eds.) Operations Research Proceedings 2013. Operations Research Proceedings, pp. 263\u2013269. Springer, Heidelberg (2014)"},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10878-009-9257-2","volume":"19","author":"EJ McDermid","year":"2012","unstructured":"McDermid, E.J., Manlove, D.F.: Keeping partners together: algorithmic results for the hospitals\/residents problem with couples. J. Comb. Optim. 19, 279\u2013303 (2012)","journal-title":"J. Comb. Optim."},{"key":"32_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-30850-5_24","volume-title":"Experimental Algorithms","author":"DF Manlove","year":"2012","unstructured":"Manlove, D.F., O\u2019Malley, G.: Paired and altruistic kidney donation in the UK: algorithms and experimentation. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 271\u2013282. Springer, Heidelberg (2012)"},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0196-6774(90)90007-2","volume":"11","author":"E Ronn","year":"1990","unstructured":"Ronn, E.: NP-complete stable matching problems. J. Algorithms 11, 285\u2013304 (1990)","journal-title":"J. Algorithms"},{"key":"32_CR21","first-page":"415","volume":"81","author":"AE Roth","year":"1991","unstructured":"Roth, A.E.: A natural experiment in the organization of entry-level labor markets: regional markets for new physicians and surgeons in the United Kingdom. Am. Econ. Rev. 81, 415\u2013440 (1991)","journal-title":"Am. Econ. Rev."},{"issue":"4","key":"32_CR22","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1287\/moor.18.4.803","volume":"18","author":"AE Roth","year":"1993","unstructured":"Roth, A.E., Rothblum, U.G., Vande Vate, J.H.: Stable matchings, optimal assignments, and linear programming. Math. Oper. Res. 18(4), 803\u2013828 (1993)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"32_CR23","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1257\/aer.97.3.828","volume":"97","author":"AE Roth","year":"2007","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.U.: Efficient kidney exchange: coincidence of wants in markets with compatibility-based preferences. Am. Econ. Rev. 97(3), 828\u2013851 (2007)","journal-title":"Am. Econ. Rev."},{"issue":"1, Ser. A","key":"32_CR24","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01586041","volume":"54","author":"UG Rothblum","year":"1992","unstructured":"Rothblum, U.G.: Characterization of stable matchings as extreme points of a polytope. Math. Program. 54(1, Ser. A), 57\u201367 (1992)","journal-title":"Math. Program."},{"issue":"3","key":"32_CR25","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1287\/moor.1060.0207","volume":"31","author":"J Sethuraman","year":"2006","unstructured":"Sethuraman, J., Teo, C.-P., Qian, L.: Many-to-one stable matching: geometry and fairness. Math. Oper. Res. 31(3), 581\u2013596 (2006)","journal-title":"Math. Oper. Res."},{"key":"32_CR26","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1016\/S0165-1889(00)00067-1","volume":"25","author":"MU \u00dcnver","year":"2001","unstructured":"\u00dcnver, M.U.: Backward unraveling over time: the evolution of strategic behavior in the entry-level British medical labor markets. J. Econ. Dyn. Control 25, 1039\u20131080 (2001)","journal-title":"J. Econ. Dyn. Control"},{"key":"32_CR27","unstructured":"Bir\u00f3, P.: University admission practices - Hungary. matching-in-practice.eu"}],"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-319-12691-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T23:29:04Z","timestamp":1676676544000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}