{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T19:15:26Z","timestamp":1725909326062},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319661575"},{"type":"electronic","value":"9783319661582"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66158-2_17","type":"book-chapter","created":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T07:24:38Z","timestamp":1503386678000},"page":"262-277","source":"Crossref","is-referenced-by-count":3,"title":["Rotation-Based Formulation for Stable Matching"],"prefix":"10.1007","author":[{"given":"Mohamed","family":"Siala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barry","family":"O\u2019Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,23]]},"reference":[{"issue":"1\u20133","key":"17_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-218X(99)00203-6","volume":"101","author":"M Ba\u00efou","year":"2000","unstructured":"Ba\u00efou, M., Balinski, M.: Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). Discrete Appl. Math. 101(1\u20133), 1\u201312 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"17_CR2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.tcs.2007.02.050","volume":"379","author":"V Bansal","year":"2007","unstructured":"Bansal, V., Agrawal, A., Malhotra, V.S.: Polynomial time algorithm for an optimal stable assignment with multiple partners. Theor. Comput. Sci. 379(3), 317\u2013328 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"17_CR3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1287\/ijoc.1110.0449","volume":"24","author":"P Eirinakis","year":"2012","unstructured":"Eirinakis, P., Magos, D., Mourtos, I., Miliotis, P.: Finding all stable pairs and solutions to the many-to-many stable matching problem. INFORMS J. Comput. 24(2), 245\u2013259 (2012)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"17_CR4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0022-0000(92)90048-N","volume":"45","author":"T Feder","year":"1992","unstructured":"Feder, T.: A new fixed point approach for stable networks and stable marriages. J. Comput. Syst. Sci. 45(2), 233\u2013284 (1992)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20133","key":"17_CR5","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.tcs.2007.04.029","volume":"381","author":"T Fleiner","year":"2007","unstructured":"Fleiner, T., Irving, R.W., Manlove, D.: Efficient algorithms for generalized stable marriage and roommates problems. Theor. Comput. Sci. 381(1\u20133), 162\u2013176 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"17_CR6","doi-asserted-by":"crossref","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. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"17_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 \u2014 CP 2001","author":"IP 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. 2239, pp. 225\u2013239. Springer, Heidelberg (2001). doi:\n10.1007\/3-540-45578-7_16"},{"key":"17_CR8","series-title":"Foundations of Computing Series","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. Foundations of Computing Series. MIT Press, Cambridge (1989)"},{"key":"17_CR9","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":"17_CR10","unstructured":"Hebrard, E.: Mistral, a constraint satisfaction library. In: Proceedings of the CP 2008 Third International CSP Solvers Competition, pp. 31\u201340 (2008)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-59776-8_13","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"E Hebrard","year":"2017","unstructured":"Hebrard, E., Siala, M.: Explanation-based weighted degree. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 167\u2013175. Springer, Cham (2017). doi:\n10.1007\/978-3-319-59776-8_13"},{"issue":"3","key":"17_CR12","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1137\/0215048","volume":"15","author":"RW Irving","year":"1986","unstructured":"Irving, R.W., Leather, P.: The complexity of counting stable marriages. SIAM J. Comput. 15(3), 655\u2013667 (1986)","journal-title":"SIAM J. Comput."},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-72397-4_12","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"DF Manlove","year":"2007","unstructured":"Manlove, D.F., O\u2019Malley, G., Prosser, P., Unsworth, C.: A constraint programming approach to the hospitals\/residents problem. In: Hentenryck, P., Wolsey, L. (eds.) CPAIOR 2007. LNCS, vol. 4510, pp. 155\u2013170. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-72397-4_12"},{"key":"17_CR14","series-title":"Series on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1142\/8591","volume-title":"Algorithmics of Matching Under Preferences","author":"DF Manlove","year":"2013","unstructured":"Manlove, D.F.: Algorithmics of Matching Under Preferences. Series on Theoretical Computer Science, vol. 2. WorldScientific, Singapore (2013)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-29828-8_15","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"L Michel","year":"2012","unstructured":"Michel, L., Hentenryck, P.: Activity-based search for black-box constraint programming solvers. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 228\u2013243. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-29828-8_15"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference, DAC 2001, Las Vegas, NV, USA, 18\u201322 June 2001, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-319-07046-9_2","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"P Prosser","year":"2014","unstructured":"Prosser, P.: Stable roommates and constraint programming. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 15\u201328. Springer, Cham (2014). doi:\n10.1007\/978-3-319-07046-9_2"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-540-30201-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P Refalo","year":"2004","unstructured":"Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557\u2013571. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-30201-8_41"},{"key":"17_CR19","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Foundations of Artificial Intelligence, vol. 2. Elsevier (2006)"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-319-33954-2_25","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"M Siala","year":"2016","unstructured":"Siala, M., O\u2019Sullivan, B.: Revisiting two-sided stability constraints. In: Quimper, C.-G. (ed.) CPAIOR 2016. LNCS, vol. 9676, pp. 342\u2013357. Springer, Cham (2016). doi:\n10.1007\/978-3-319-33954-2_25"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","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. 3607, pp. 218\u2013233. Springer, Heidelberg (2005). doi:\n10.1007\/11527862_16"},{"key":"17_CR22","unstructured":"Unsworth, C., Prosser, P.: An n-ary constraint for the stable marriage problem. CoRR, abs\/1308.0183 (2013)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66158-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T07:31:20Z","timestamp":1503387080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66158-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319661575","9783319661582"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66158-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}