{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:40:31Z","timestamp":1794379231365,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540278726","type":"print"},{"value":"9783540318828","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11527862_16","type":"book-chapter","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T15:48:01Z","timestamp":1279640881000},"page":"218-233","source":"Crossref","is-referenced-by-count":7,"title":["A Specialised Binary Constraint for the Stable Marriage Problem"],"prefix":"10.1007","author":[{"given":"Chris","family":"Unsworth","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick","family":"Prosser","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"ILOG JSolver, \n                    \n                      http:\/\/www.ilog.com\/products\/jsolver\/"},{"key":"16_CR2","unstructured":"JChoco constraint programming system, \n                    \n                      http:\/\/choco.sourceforge.net\/"},{"key":"16_CR3","unstructured":"Koalog Constraint Solver, \n                    \n                      http:\/\/www.koalog.com\/"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1026453915989","volume":"4","author":"B. Aldershof","year":"1999","unstructured":"Aldershof, B., Carducci, O.: Refined inequalities for stable marriage. Constraints\u00a04, 281\u2013292 (1999)","journal-title":"Constraints"},{"key":"16_CR5","unstructured":"Canadian Resident Matching Service. How the matching algorithm works. Web document, available at \n                    \n                      http:\/\/www.carms.ca\/matching\/algorith.htm"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.: College admissions and the stability of marriage. American Mathematical Monthly\u00a069, 9\u201315 (1962)","journal-title":"American Mathematical Monthly"},{"key":"16_CR7","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. Gent","year":"2001","unstructured":"Gent, I., Irving, R., Manlove, D., Prosser, P., Smith, B.: 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":"16_CR8","unstructured":"Gent, I., Prosser, P.: An empirical study of the stable marriage problem with ties and incomplete lists. In: ECAI 2002 (2002)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Green","year":"2003","unstructured":"Green, M., Cohen, D.: Tractability by approximating constraint languages. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 392\u2013406. Springer, Heidelberg (2003)"},{"key":"16_CR10","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. The MIT Press, Cambridge (1989)"},{"key":"16_CR11","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. Irving","year":"1998","unstructured":"Irving, R.: 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":"16_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jagm.2002.1219","volume":"43","author":"R. Irving","year":"2002","unstructured":"Irving, R., Manlove, D.: The stable roommates problem with ties. Journal of Algorithms\u00a043, 85\u2013105 (2002)","journal-title":"Journal of Algorithms"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF03167200","volume":"10","author":"A. Kato","year":"1993","unstructured":"Kato, A.: Complexity of the sex-equal stable marriage problem. Japan Journal of Industrial and Applied Mathematics (JJIAM)\u00a010, 1\u201319 (1993)","journal-title":"Japan Journal of Industrial and Applied Mathematics (JJIAM)"},{"key":"16_CR14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1287\/inte.31.6.29.9647","volume":"31","author":"I. Lustig","year":"2001","unstructured":"Lustig, I., Puget, J.: Program does not equal program: constraint programming and its relationship to mathematical programming. Interfaces\u00a031, 29\u201353 (2001)","journal-title":"Interfaces"},{"key":"16_CR15","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"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"D. Manlove","year":"2002","unstructured":"Manlove, D., Irving, R., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theoretical Computer Science\u00a0276, 261\u2013279 (2002)","journal-title":"Theoretical Computer Science"},{"key":"16_CR17","unstructured":"N.\u00a0R.\u00a0M. Program. About the NRMP. Web document available at \n                    \n                      http:\/\/www.nrmp.org\/about_nrmp\/how.html"},{"issue":"6","key":"16_CR18","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"A. Roth","year":"1984","unstructured":"Roth, A.: 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":"16_CR19","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","Abstraction, Reformulation and Approximation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11527862_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:23:13Z","timestamp":1558282993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11527862_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540278726","9783540318828"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11527862_16","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11527862","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}