{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T15:38:59Z","timestamp":1775403539606,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T00:00:00Z","timestamp":1585008000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T00:00:00Z","timestamp":1585008000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"crossref","award":["RGPIN-2018-04335"],"award-info":[{"award-number":["RGPIN-2018-04335"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s11590-020-01557-4","type":"journal-article","created":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T19:03:01Z","timestamp":1585076581000},"page":"2615-2623","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Three-dimensional stable matching with cyclic preferences"],"prefix":"10.1007","volume":"14","author":[{"given":"Kanstantsin","family":"Pashkovich","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9900-1374","authenticated-orcid":false,"given":"Laurent","family":"Poirrier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,24]]},"reference":[{"key":"1557_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-09284-3_15","volume-title":"Theory and Applications of Satisfiability Testing\u2014SAT 2014","author":"G Audemard","year":"2014","unstructured":"Audemard, G., Simon, L.: Lazy clause exchange policy for parallel sat solvers. In: Sinz, C., Egly, U. (eds.) Theory and Applications of Satisfiability Testing\u2014SAT 2014, pp. 197\u2013205. Springer, Cham (2014)"},{"key":"1557_CR2","unstructured":"Biere, A.: CaDiCaL, lingeling, plingeling, treengeling, YalSAT entering the SAT competition 2017. In: Balyo, T., Heule, M., J\u00e4rvisalo, M. (eds.) Proceedings\u00a0of SAT Competition 2017\u2014Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, vol. 1, pp. 14\u201315. University of Helsinki (2017)"},{"issue":"1","key":"1557_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00453-009-9315-2","volume":"58","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., McDermid, E.: Three-sided stable matchings with cyclic preferences. Algorithmica 58(1), 5\u201318 (2010). https:\/\/doi.org\/10.1007\/s00453-009-9315-2","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"1557_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2004.08.012","volume":"289","author":"E Boros","year":"2004","unstructured":"Boros, E., Gurvich, V., Jaslar, S., Krasner, D.: Stable matchings in three-sided systems with cyclic preferences. Discrete Math. 289(1\u20133), 1\u201310 (2004). https:\/\/doi.org\/10.1016\/j.disc.2004.08.012","journal-title":"Discrete Math."},{"key":"1557_CR5","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) Theory and Applications of Satisfiability Testing, pp. 502\u2013518. Springer, Berlin (2004)"},{"issue":"1","key":"1557_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.mathsocsci.2006.03.005","volume":"52","author":"K Eriksson","year":"2006","unstructured":"Eriksson, K., Sj\u00f6strand, J., Strimling, P.: Three-dimensional stable matching with cyclic preferences. Math. Soc. Sci. 52(1), 77\u201387 (2006). https:\/\/doi.org\/10.1016\/j.mathsocsci.2006.03.005","journal-title":"Math. Soc. Sci."},{"issue":"4","key":"1557_CR7","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00224-016-9687-z","volume":"59","author":"L Farczadi","year":"2016","unstructured":"Farczadi, L., Georgiou, K., K\u00f6nemann, J.: Stable marriage with general preferences. Theory Comput. Syst. 59(4), 683\u2013699 (2016). https:\/\/doi.org\/10.1007\/s00224-016-9687-z","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"1557_CR8","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"1557_CR9","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.mathsocsci.2016.04.006","volume":"82","author":"J Hofbauer","year":"2016","unstructured":"Hofbauer, J.: d-Dimensional stable matching with cyclic preferences. Math. Soc. Sci. 82, 72\u201376 (2016). https:\/\/doi.org\/10.1016\/j.mathsocsci.2016.04.006","journal-title":"Math. Soc. Sci."},{"key":"1557_CR10","unstructured":"Knuth, D.E.: Mariages stables et leurs relations avec d\u2019autres probl\u00e8mes combinatoires. In: Introduction \u00e0 l\u2019analyse math\u00e9matique des algorithmes, Collection de la Chaire Aisenstadt. Les Presses de l\u2019Universit\u00e9 de Montr\u00e9al, Montreal (1976)"},{"key":"1557_CR11","doi-asserted-by":"crossref","unstructured":"Lam, C.K., Plaxton, C.G.: On the existence of three-dimensional stable matchings with cyclic preferences. arXiv e-prints arXiv:1905.02844 (2019)","DOI":"10.1007\/978-3-030-30473-7_22"},{"issue":"2","key":"1557_CR12","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/0404023","volume":"4","author":"C Ng","year":"1991","unstructured":"Ng, C., Hirschberg, D.S.: Three-dimensional stable matching problems. SIAM J. Discrete Math. 4(2), 245\u2013252 (1991). https:\/\/doi.org\/10.1137\/0404023","journal-title":"SIAM J. Discrete Math."},{"key":"1557_CR13","doi-asserted-by":"publisher","unstructured":"Nguyen, V.H., Mai, S.T.: A new method to encode the at-most-one constraint into SAT. In: Proceedings of the Sixth International Symposium on Information and Communication Technology, SoICT 2015, pp. 46\u201353. ACM, New York (2015). https:\/\/doi.org\/10.1145\/2833258.2833293","DOI":"10.1145\/2833258.2833293"},{"key":"1557_CR14","doi-asserted-by":"publisher","unstructured":"Pashkovich, K., Poirrier, L.: Three-dimensional stable matching with cyclic preferences: computational proofs log files (2018). https:\/\/doi.org\/10.5281\/zenodo.3544492","DOI":"10.5281\/zenodo.3544492"},{"key":"1557_CR15","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.3544490","author":"K Pashkovich","year":"2018","unstructured":"Pashkovich, K., Poirrier, L.: Three-dimensional stable matching with cyclic preferences: DIMACS CNF generator (2018). https:\/\/doi.org\/10.5281\/zenodo.3544490","journal-title":"Three-dimensional stable matching with cyclic preferences: DIMACS CNF generator"},{"key":"1557_CR16","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/11564751_73","volume-title":"Principles and Practice of Constraint Programming\u2014CP 2005","author":"C Sinz","year":"2005","unstructured":"Sinz, C.: Towards an optimal CNF encoding of boolean cardinality constraints. In: van Beek, P. (ed.) Principles and Practice of Constraint Programming\u2014CP 2005, pp. 827\u2013831. Springer, Berlin (2005)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01557-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-020-01557-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01557-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T01:08:37Z","timestamp":1616548117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-020-01557-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,24]]},"references-count":16,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1557"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01557-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,24]]},"assertion":[{"value":"28 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}