{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:36:18Z","timestamp":1759667778987},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540723967"},{"type":"electronic","value":"9783540723974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72397-4_12","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T15:56:32Z","timestamp":1182527792000},"page":"155-170","source":"Crossref","is-referenced-by-count":9,"title":["A Constraint Programming Approach to the Hospitals \/ Residents Problem"],"prefix":"10.1007","author":[{"given":"David F.","family":"Manlove","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregg","family":"O\u2019Malley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Prosser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Unsworth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1026453915989","volume":"4","author":"B. Aldershof","year":"1999","unstructured":"Aldershof, B., Carducci, O.M., Lorenc, D.C.: Refined inequalities for stable marriage. Constraints\u00a04, 281\u2013292 (1999)","journal-title":"Constraints"},{"key":"12_CR2","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.-C.: Arc consistency for general constraint networks: Preliminary results. In: Proceedings of IJCAI \u201997, vol.\u00a01, pp. 398\u2013404 (1997)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11564751_14","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"I. Brito","year":"2005","unstructured":"Brito, I., Meseguer, P.: Distributed stable matching problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 152\u2013166. Springer, Heidelberg (2005)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/11889205_49","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"I. Brito","year":"2006","unstructured":"Brito, I., Meseguer, P.: Distributed stable matching problems with ties and incomplete lists. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 675\u2013679. Springer, Heidelberg (2006)"},{"key":"12_CR5","unstructured":"Canadian Resident Matching Service. How the matching algorithm works. Web document available at http:\/\/www.carms.ca\/matching\/algorith.htm"},{"issue":"1-3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/S0304-3975(03)00319-0","volume":"306","author":"V.M.F. Dias","year":"2003","unstructured":"Dias, V.M.F., da Fonseca, G.D., de Figueiredo, C.M.H., Szwarcfiter, J.L.: The stable marriage problem with restricted pairs. Theoretical Computer Science\u00a0306(1-3), 391\u2013405 (2003)","journal-title":"Theoretical Computer Science"},{"key":"12_CR7","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. American Mathematical Monthly\u00a069, 9\u201315 (1962)","journal-title":"American Mathematical Monthly"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-45578-7_16","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"I.P. Gent","year":"2001","unstructured":"Gent, I.P., Irving, R.W., Manlove, D.F., Prosser, P., Smith, B.M.: A constraint programming approach to the stable marriage problem. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 225\u2013239. Springer, Heidelberg (2001)"},{"key":"12_CR9","first-page":"141","volume-title":"Proceedings of ECAI \u201902","author":"I.P. Gent","year":"2002","unstructured":"Gent, I.P., Prosser, P.: An empirical study of the stable marriage problem with ties and incomplete lists. In: Proceedings of ECAI \u201902, pp. 141\u2013145. IOS Press, Amsterdam (2002)"},{"key":"12_CR10","unstructured":"Gent, I.P., Prosser, P.: SAT encodings of the stable marriage problem with ties and incomplete lists. In: Proceedings of SAT \u201902, pp. 133\u2013140 (2002)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/978-3-540-45193-8_27","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"M.J. Green","year":"2003","unstructured":"Green, M.J., Cohen, D.A.: Tractability by approximating constraint languages. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 392\u2013406. Springer, Heidelberg (2003)"},{"key":"12_CR12","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D. Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/3-540-68530-8_32","volume-title":"Algorithms - ESA \u201998","author":"R.W. Irving","year":"1998","unstructured":"Irving, R.W.: Matching medical students to pairs of hospitals: a new variation on a well-known theme. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 381\u2013392. Springer, Heidelberg (1998)"},{"key":"12_CR14","unstructured":"Irving, R.W.: The Man-Exchange Stable Marriage Problem. Technical Report TR-2004-177, University of Glasgow, Department of Computing Science (2004)"},{"key":"12_CR15","volume-title":"Mariages Stables","author":"D.E. Knuth","year":"1976","unstructured":"Knuth, D.E.: Mariages Stables. Les Presses de L\u2019Universit\u00e9 de Montr\u00e9al, Montr\u00e9al (1976)"},{"key":"12_CR16","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1287\/inte.31.6.29.9647","volume":"31","author":"I.J. Lustig","year":"2001","unstructured":"Lustig, I.J., Puget, J.: Program does not equal program: constraint programming and its relationship to mathematical programming. Interfaces\u00a031, 29\u201353 (2001)","journal-title":"Interfaces"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence\u00a08, 99\u2013118 (1977)","journal-title":"Artificial Intelligence"},{"issue":"1-2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"D.F. Manlove","year":"2002","unstructured":"Manlove, D.F., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theoretical Computer Science\u00a0276(1-2), 261\u2013279 (2002)","journal-title":"Theoretical Computer Science"},{"key":"12_CR19","unstructured":"Manlove, D.F., O\u2019Malley, G.: Modelling and solving the stable marriage problem using constraint programming. In: Proceedings of the Fifth Workshop on Modelling and Solving Problems with Constraints, held at IJCAI \u201905, pp. 10\u201317 (2005)"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Manlove, D.F., O\u2019Malley, G., Prosser, P., Unsworth, C.: A Constraint Programming Approach to the Hospitals \/ Residents Problem. Technical Report TR-2007-236, University of Glasgow, Department of Computing Science (2007)","DOI":"10.1007\/978-3-540-72397-4_12"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ipl.2006.07.005","volume":"101","author":"E. McDermid","year":"2007","unstructured":"McDermid, E., Cheng, C., Suzuki, I.: Hardness results on the man-exchange stable marriage problem with short preference lists. Information Processing Letters\u00a0101, 13\u201319 (2007)","journal-title":"Information Processing Letters"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1137\/0219004","volume":"19","author":"C. Ng","year":"1990","unstructured":"Ng, C., Hirschberg, D.S.: Lower bounds for the stable marriage problem and its variants. SIAM Journal on Computing\u00a019, 71\u201377 (1990)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR23","unstructured":"National Resident\u00a0Matching Program. About the NRMP. Web document available at http:\/\/www.nrmp.org\/about_nrmp\/how.html"},{"key":"12_CR24","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. Journal of Algorithms\u00a011, 285\u2013304 (1990)","journal-title":"Journal of Algorithms"},{"issue":"6","key":"12_CR25","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"A.E. Roth","year":"1984","unstructured":"Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. Journal of Political Economy\u00a092(6), 991\u20131016 (1984)","journal-title":"Journal of Political Economy"},{"key":"12_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-sided matching: a study in game-theoretic modeling and analysis","author":"A.E. Roth","year":"1990","unstructured":"Roth, A.E., Sotomayor, M.A.O.: Two-sided matching: a study in game-theoretic modeling and analysis. Cambridge University Press, Cambridge (1990)"},{"key":"12_CR27","unstructured":"Silaghi, M.-C., Zanker, M., Bart\u00e1k, R.: Desk-mates (stable matching) with privacy of preferences, and a new distributed CSP framework. In: Proceedings of the CP 2004 workshop on CSP Techniques with Immediate Application (CSPIA), pp. 83\u201396 (2004)"},{"key":"12_CR28","first-page":"671","volume-title":"Proceedings of FLAIRS 2005","author":"M.-C. Silaghi","year":"2005","unstructured":"Silaghi, M.-C., Abhyankar, A., Zanker, M., Bart\u00e1k, R.: Desk-mates (stable matching) with privacy of preferences, and a new distributed CSP framework. In: Proceedings of FLAIRS 2005, pp. 671\u2013677. AAAI Press, Menlo Park (2005)"},{"key":"12_CR29","unstructured":"Unsworth, C., Prosser, P.: An n-ary constraint for the stable marriage problem. In: Proceedings of the Fifth Workshop on Modelling and Solving Problems with Constraints, held at IJCAI \u201905, pp. 32\u201338 (2005)"},{"key":"12_CR30","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/11527862_16","volume-title":"Abstraction, Reformulation and Approximation","author":"C. Unsworth","year":"2005","unstructured":"Unsworth, C., Prosser, P.: A specialised binary constraint for the stable marriage problem. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol.\u00a03607, pp. 218\u2013233. Springer, Heidelberg (2005)"},{"key":"12_CR31","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0004-3702(92)90020-X","volume":"57","author":"P. Hentenryck van","year":"1992","unstructured":"van Hentenryck, P., Deville, Y., Teng, C.-M.: A generic arc-consistency algorithm and its specializations. Artificial Intelligence\u00a057, 291\u2013321 (1992)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72397-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T05:10:01Z","timestamp":1556514601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72397-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540723967","9783540723974"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72397-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}