{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T16:21:01Z","timestamp":1758126061113},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T00:00:00Z","timestamp":1405382400000},"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":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s10100-014-0356-5","type":"journal-article","created":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T12:43:59Z","timestamp":1405341839000},"page":"547-562","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Modelling practical placement of trainee teachers to schools"],"prefix":"10.1007","volume":"23","author":[{"given":"Katar\u00edna","family":"Cechl\u00e1rov\u00e1","sequence":"first","affiliation":[]},{"given":"Tam\u00e1s","family":"Fleiner","sequence":"additional","affiliation":[]},{"given":"David F.","family":"Manlove","sequence":"additional","affiliation":[]},{"given":"Iain","family":"McBride","sequence":"additional","affiliation":[]},{"given":"Eva","family":"Potpinkov\u00e1","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,15]]},"reference":[{"key":"356_CR1","doi-asserted-by":"crossref","unstructured":"Abdulkadiroglu A, Pathak PA, Roth AE (2005a) The New York City high school match. Am Econ Rev 95(2):364\u2013367","DOI":"10.1257\/000282805774670167"},{"key":"356_CR2","doi-asserted-by":"crossref","unstructured":"Abdulkadiroglu A, Pathak PA, Roth AE, S\u00f6nmez T (2005b) The Boston public school match. Am Econ Rev 95(2):368\u2013371","DOI":"10.1257\/000282805774669637"},{"key":"356_CR3","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Upper Saddle River"},{"key":"356_CR4","first-page":"3","volume":"3341","author":"D Abraham","year":"2004","unstructured":"Abraham D, Cechl\u00e1rov\u00e1 K, Manlove D, Mehlhorn K (2004) Pareto optimality in house allocation problems. LNCS 3341:3\u201315","journal-title":"LNCS"},{"key":"356_CR5","unstructured":"Berman P, Karpinski M, Scott AD (2003) Approximation hardness of short symmetric instances of MAX-3SAT, Electronic Colloquium on Computational Complexity Report, number 49"},{"issue":"34\u201336","key":"356_CR6","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(34\u201336):3136\u20133153","journal-title":"Theoret Comput Sci"},{"key":"356_CR7","doi-asserted-by":"crossref","unstructured":"Bir\u00f3 P, Kiselgof S (2013) College admissions with stable score-limits. Cent Eur J Oper Res. doi: 10.1007\/s10100-013-0320-9","DOI":"10.1007\/s10100-013-0320-9"},{"key":"356_CR8","doi-asserted-by":"crossref","unstructured":"Bir\u00f3 P and Klijn F (2013) Matching with couples: a multidisciplinary survey. Int Game Theory Rev 15(2) article number 1340008","DOI":"10.1142\/S0219198913400082"},{"key":"356_CR9","doi-asserted-by":"crossref","unstructured":"Bir\u00f3 P, McDermid E (2014) Matching with sizes (or scheduling with processing set restrictions). Discret Appl Math 164\/1, 61\u201367","DOI":"10.1016\/j.dam.2011.11.003"},{"key":"356_CR10","doi-asserted-by":"crossref","unstructured":"Bir\u00f3 P, Manlove DF and McBride I (2013)The hospitals\/residents problem with couples: complexity and integer programming models. Tech Rep arXiv:1308.4534 , Computing Research Repository, Cornell University Library","DOI":"10.1007\/978-3-319-07959-2_2"},{"key":"356_CR11","doi-asserted-by":"crossref","unstructured":"Bir\u00f3 P, Irving RW, Schlotter I (2011) Stable matching with couples: an empirical study. ACM J Exp Algorithmics. 16\/1, Article 1.2","DOI":"10.1145\/1963190.1970372"},{"issue":"1","key":"356_CR12","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"},{"key":"356_CR13","volume-title":"Computers and intractability","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. Freeman, San Francisco"},{"key":"356_CR14","volume-title":"The stable marriage problem: structure and algorithms, foundations od computing","author":"D Gusfield","year":"1989","unstructured":"Gusfield D, Irving RW (1989) The stable marriage problem: structure and algorithms, foundations od computing. MIT Press, Cambridge"},{"key":"356_CR15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF02099694","volume":"57","author":"A Hefner","year":"1995","unstructured":"Hefner A, Kleinschmidt P (1995) A constrained matching problem. Ann OR 57:135\u2013145","journal-title":"Ann OR"},{"key":"356_CR16","first-page":"381","volume":"1461","author":"RW Irving","year":"1998","unstructured":"Irving RW (1998) Matching medical students to pairs of hospitals: a new variation on an old theme. LNCS 1461:381\u2013392","journal-title":"LNCS"},{"issue":"3","key":"356_CR17","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10878-009-9257-2","volume":"19","author":"E McDermid","year":"2010","unstructured":"McDermid E, Manlove DF (2010) Keeping partners together: algorithmic results for the hospitals\/residents problem with couples. J Comb Optim 19(3):279\u2013303","journal-title":"J Comb Optim"},{"key":"356_CR18","doi-asserted-by":"crossref","DOI":"10.1142\/8591","volume-title":"Algorithmics of matching under preferences","author":"DF Manlove","year":"2013","unstructured":"Manlove DF (2013) Algorithmics of matching under preferences. World Scientific, Singapore"},{"issue":"4","key":"356_CR19","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1086\/261272","volume":"6","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 6(4):991\u20131016","journal-title":"J Polit Econ"},{"key":"356_CR20","unstructured":"Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Algorithms and Combinatorics, vol 24. Springer, Berlin, Heidelberg"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0356-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-014-0356-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0356-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T19:34:57Z","timestamp":1565638497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-014-0356-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,15]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["356"],"URL":"https:\/\/doi.org\/10.1007\/s10100-014-0356-5","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,15]]}}}