{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T02:39:10Z","timestamp":1773801550255,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,10,19]],"date-time":"2016-10-19T00:00:00Z","timestamp":1476835200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Hungarian Scientific Research Fund, OTKA","award":["K108673"],"award-info":[{"award-number":["K108673"]}]},{"name":"Hungarian Academy of Sciences under its Momentum Programme","award":["LD-004\/2010"],"award-info":[{"award-number":["LD-004\/2010"]}]},{"name":"Janos Bolyai Research Scholarship of the Hungarian Academy of Sciences"},{"name":"SICSA Prize PhD Studentship"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s10878-016-0085-x","type":"journal-article","created":{"date-parts":[[2016,10,19]],"date-time":"2016-10-19T07:18:32Z","timestamp":1476861512000},"page":"1371-1399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Integer programming methods for special college admissions problems"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7011-3463","authenticated-orcid":false,"given":"Kolos Csaba","family":"\u00c1goston","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P\u00e9ter","family":"Bir\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iain","family":"McBride","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,19]]},"reference":[{"key":"85_CR1","doi-asserted-by":"crossref","unstructured":"Abraham D, Blum A, Sandholm T (2007) Clearing algorithms for Barter-Exchange Markets: enabling nationwide kidney exchanges. In: Proceedings of ACM-EC 2007: the eighth ACM conference on electronic commerce. ACM, New York, pp 295\u2013304","DOI":"10.1145\/1250910.1250954"},{"key":"85_CR2","unstructured":"Abdulkadiroglu A, Ehlers L (2007) Controlled school choice. Working paper"},{"key":"85_CR3","doi-asserted-by":"crossref","unstructured":"Azavedo EM, Leshno JD (2012) A supply and demand framework for two-sided matching markets. Working paper","DOI":"10.2139\/ssrn.2260567"},{"issue":"3","key":"85_CR4","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s101070050004","volume":"87","author":"M Ba\u00efou","year":"2000","unstructured":"Ba\u00efou M, Balinski M (2000) The stable admissions polytope. Math Program 87(3):427\u2013439","journal-title":"Math Program"},{"key":"85_CR5","unstructured":"Bir\u00f3 P (2008) Student admissions in Hungary as Gale and Shapley envisaged. Technical report, no. TR-2008-291 of the Computing Science Department of Glasgow University"},{"key":"85_CR6","unstructured":"Bir\u00f3 P (2012) University admission practices\u2014Hungary. http:\/\/www.matching-in-practice.eu . Accessed 23 May 2012"},{"key":"85_CR7","doi-asserted-by":"crossref","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 RW, Manlove DF (2010) The college admissions problem with lower and common quotas. Theoret Comput Sci 411:3136\u20133153","journal-title":"Theoret Comput Sci"},{"key":"85_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1963190.1970372","volume":"16","author":"P Bir\u00f3","year":"2011","unstructured":"Bir\u00f3 P, Irving RW, Schlotter I (2011) Stable matching with couples\u2014an empirical study. ACM J Exp Algorithm 16:1\u20132","journal-title":"ACM J Exp Algorithm"},{"issue":"4","key":"85_CR9","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/s10100-013-0320-9","volume":"23","author":"P Bir\u00f3","year":"2015","unstructured":"Bir\u00f3 P, Kiselgof S (2015) College admissions with stable score-limits. CEJOR 23(4):727\u2013741","journal-title":"CEJOR"},{"issue":"2","key":"85_CR10","doi-asserted-by":"crossref","first-page":"1340008","DOI":"10.1142\/S0219198913400082","volume":"15","author":"P Bir\u00f3","year":"2013","unstructured":"Bir\u00f3 P, Klijn F (2013) Matching with couples: a multidisciplinary survey. Int Game Theory Rev 15(2):1340008","journal-title":"Int Game Theory Rev"},{"key":"85_CR11","doi-asserted-by":"crossref","unstructured":"Bir\u00f3 P, McBride I (2014) Integer programming methods for special college admissions problems. In: Proceedings of COCOA 2014: the 8th annual international conference on combinatorial optimization and applications. LNCS, vol 8881. Springer, Berlin, pp 429\u2013443","DOI":"10.1007\/978-3-319-12691-3_32"},{"key":"85_CR12","doi-asserted-by":"crossref","unstructured":"Bir\u00f3 P, McBride I, Manlove DF (2014) The hospitals\/residents problem with couples: complexity and integer programming models. In: Proceedings of SEA 2014: the 13th international symposium on experimental algorithms. LNCS, vol 8504. Springer, New York, pp 10\u201321","DOI":"10.1007\/978-3-319-07959-2_2"},{"key":"85_CR13","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0165-4896(03)00074-X","volume":"46","author":"T Fleiner","year":"2003","unstructured":"Fleiner T (2003) On the stable $$b$$ b -matching polytope. Math Soc Sci 46:149\u2013158","journal-title":"Math Soc Sci"},{"issue":"1","key":"85_CR14","doi-asserted-by":"crossref","first-page":"32","DOI":"10.3390\/a7010032","volume":"7","author":"T Fleiner","year":"2014","unstructured":"Fleiner T, Jank\u00f3 Zs (2014) Choice function-based two-sided markets: stability, lattice property, path independence and algorithms. Algorithms 7(1):32\u201359","journal-title":"Algorithms"},{"issue":"1","key":"85_CR15","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69(1):9\u201315","journal-title":"Am Math Mon"},{"issue":"3","key":"85_CR16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(85)90074-5","volume":"11","author":"D Gale","year":"1985","unstructured":"Gale D, Sotomayor MAO (1985) Some remarks on the stable matching problem. Discret Appl Math 11(3):223\u2013232","journal-title":"Discret Appl Math"},{"key":"85_CR17","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/s10878-008-9153-1","volume":"16","author":"RW Irving","year":"2008","unstructured":"Irving RW (2008) Stable matching problems with exchange restrictions. J Comb Optim 16:344\u2013360","journal-title":"J Comb Optim"},{"key":"85_CR18","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10878-007-9133-x","volume":"16","author":"RW Irving","year":"2008","unstructured":"Irving RW, Manlove DF (2008) Approximation algorithms for hard variants of the stable marriage and hospitals\/residents problems. J Comb Optim 16:279\u2013292","journal-title":"J Comb Optim"},{"issue":"3","key":"85_CR19","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1257\/aer.102.3.366","volume":"102","author":"Y Kamada","year":"2012","unstructured":"Kamada Y, Kojima F (2012) Stability and strategy-proofness for matching with constraints: a problem in the Japanese medical match and its solution. Am Econ Rev 102(3):366\u2013370","journal-title":"Am Econ Rev"},{"key":"85_CR20","doi-asserted-by":"crossref","unstructured":"Kwanashie A, Manlove DF (2014) An integer programming approach to the hospitals \/ residents problem with ties. In: Proceedings of OR 2013: the international conference on operations research. Springer, Berlin, pp 263\u2013269","DOI":"10.1007\/978-3-319-07001-8_36"},{"key":"85_CR21","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10878-009-9257-2","volume":"19","author":"EJ McDermid","year":"2012","unstructured":"McDermid EJ, Manlove DF (2012) Keeping partners together: algorithmic results for the hospitals\/residents problem with couples. J Comb Optim 19:279\u2013303","journal-title":"J Comb Optim"},{"key":"85_CR22","doi-asserted-by":"crossref","unstructured":"Manlove DF, O\u2019Malley G (2012) Paired and altruistic kidney donation in the UK: algorithms and experimentation. In: Proceedings of SEA 2012: the 11th international symposium on experimental algorithms. LNCS, vol 7276. Springer, Berlin, pp 271\u2013282","DOI":"10.1007\/978-3-642-30850-5_24"},{"key":"85_CR23","unstructured":"Podhradsky A (2010) Stable marriage problem algorithms. Master\u2019s thesis, Faculty of Informatics, Masaryk University"},{"key":"85_CR24","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0196-6774(90)90007-2","volume":"11","author":"E Ronn","year":"1990","unstructured":"Ronn E (1990) NP-complete stable matching problems. J Algorithms 11:285\u2013304","journal-title":"J Algorithms"},{"issue":"6","key":"85_CR25","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"AE Roth","year":"1984","unstructured":"Roth AE (1984) The evolution of the labor market for medical interns and residents: a case study in game theory. J Polit Econ 92(6):991\u20131016","journal-title":"J Polit Econ"},{"key":"85_CR26","first-page":"415","volume":"81","author":"AE Roth","year":"1991","unstructured":"Roth AE (1991) 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","journal-title":"Am Econ Rev"},{"issue":"2","key":"85_CR27","doi-asserted-by":"crossref","first-page":"425","DOI":"10.2307\/1913160","volume":"54","author":"AE Roth","year":"1986","unstructured":"Roth AE (1986) On the allocation of residents to rural hospitals: a general property of two-sided matching markets. Econometrica 54(2):425\u2013427","journal-title":"Econometrica"},{"issue":"4","key":"85_CR28","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/moor.18.4.803","volume":"18","author":"AE Roth","year":"1993","unstructured":"Roth AE, Rothblum UG, Vande Vate JH (1993) Stable matchings, optimal assignments, and linear programming. Math Oper Res 18(4):803\u2013828","journal-title":"Math Oper Res"},{"issue":"3","key":"85_CR29","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1257\/aer.97.3.828","volume":"97","author":"AE Roth","year":"2007","unstructured":"Roth AE, S\u00f6nmez T, \u00dcnver MU (2007) Efficient kidney exchange: coincidence of wants in markets with compatibility-based preferences. Am Econ Rev 97(3):828\u2013851","journal-title":"Am Econ Rev"},{"issue":"1, Ser. A","key":"85_CR30","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01586041","volume":"54","author":"UG Rothblum","year":"1992","unstructured":"Rothblum UG (1992) Characterization of stable matchings as extreme points of a polytope. Math Program 54(1, Ser. A):57\u201367","journal-title":"Math Program"},{"issue":"3","key":"85_CR31","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1287\/moor.1060.0207","volume":"31","author":"J Sethuraman","year":"2006","unstructured":"Sethuraman J, Teo C-P, Qian L (2006) Many-to-one stable matching: geometry and fairness. Math Oper Res 31(3):581\u2013596","journal-title":"Math Oper Res"},{"key":"85_CR32","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1016\/S0165-1889(00)00067-1","volume":"25","author":"MU \u00dcnver","year":"2001","unstructured":"\u00dcnver MU (2001) Backward unraveling over time: the evolution of strategic behavior in the entry-level British medical labor markets. J Econ Dyn Control 25:1039\u20131080","journal-title":"J Econ Dyn Control"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0085-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0085-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0085-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T19:30:09Z","timestamp":1601148609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0085-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,19]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["85"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0085-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,19]]}}}