{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T06:30:06Z","timestamp":1770964206406,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030802226","type":"print"},{"value":"9783030802233","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-80223-3_24","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T14:13:49Z","timestamp":1625148829000},"page":"349-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling Reach Mahjong Tournaments Using Pseudoboolean Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2323-1771","authenticated-orcid":false,"given":"Martin Mariusz","family":"Lester","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"key":"24_CR1","unstructured":"European Mahjong Association. http:\/\/mahjong-europe.org\/"},{"key":"24_CR2","unstructured":"The on-line encyclopedia of integer sequences. https:\/\/oeis.org\/A000108, sequence A000108"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-73817-6_2","volume-title":"Recent Advances in Constraints","author":"F Azevedo","year":"2007","unstructured":"Azevedo, F.: An attempt to dynamically break symmetries in the social golfers problem. In: Azevedo, F., Barahona, P., Fages, F., Rossi, F. (eds.) CSCLP 2006. LNCS (LNAI), vol. 4651, pp. 33\u201347. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73817-6_2"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.artint.2015.01.002","volume":"223","author":"A Balint","year":"2015","unstructured":"Balint, A., Belov, A., J\u00e4rvisalo, M., Sinz, C.: Overview and analysis of the SAT challenge 2012 solver competition. Artif. Intell. 223, 120\u2013155 (2015). https:\/\/doi.org\/10.1016\/j.artint.2015.01.002","journal-title":"Artif. Intell."},{"issue":"1\u20133","key":"24_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.disc.2004.01.005","volume":"283","author":"DR Berman","year":"2004","unstructured":"Berman, D.R., McLaurin, S.C., Smith, D.D.: Ranking whist players. Discret. Math. 283(1\u20133), 15\u201328 (2004). https:\/\/doi.org\/10.1016\/j.disc.2004.01.005","journal-title":"Discret. Math."},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/11890584_12","volume-title":"Hybrid Metaheuristics","author":"C Cotta","year":"2006","unstructured":"Cotta, C., Dot\u00fa, I., Fern\u00e1ndez, A.J., Van Hentenryck, P.: Scheduling social golfers with memetic evolutionary programming. In: Almeida, F., et al. (eds.) HM 2006. LNCS, vol. 4030, pp. 150\u2013161. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11890584_12"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/11493853_13","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"I Dot\u00fa","year":"2005","unstructured":"Dot\u00fa, I., Van Hentenryck, P.: Scheduling social golfers locally. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 155\u2013167. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11493853_13"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-72200-7_23","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2007","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: clasp: a conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 260\u2013265. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72200-7_23"},{"key":"24_CR9","unstructured":"Gent, I.P., Lynce, I.: A SAT encoding for the social golfer problem. In: In IJCAI2005 Workshop on Modelling and Solving Problems with Constraints (2005). https:\/\/www.inesc-id.pt\/ficheiros\/publicacoes\/2516.pdf"},{"key":"24_CR10","unstructured":"Harvey, W.: CSPLib problem 010: Social golfers problem. http:\/\/www.csplib.org\/Problems\/prob010"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/11564751_23","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"W Harvey","year":"2005","unstructured":"Harvey, W., Winterer, T.: Solving the MOLR and social golfers problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 286\u2013300. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564751_23"},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10479-015-1914-5","volume":"235","author":"F Lardeux","year":"2015","unstructured":"Lardeux, F., Monfroy, E., Crawford, B., Soto, R.: Set constraint model and automated encoding into SAT: application to the social golfer problem. Ann. Oper. Res. 235(1), 423\u2013452 (2015). https:\/\/doi.org\/10.1007\/s10479-015-1914-5","journal-title":"Ann. Oper. Res."},{"key":"24_CR13","doi-asserted-by":"publisher","unstructured":"Lester, M.M.: CoMaToSe: Constraint Mahjong Tournament Scheduler (May 2021). https:\/\/doi.org\/10.5281\/zenodo.4764650","DOI":"10.5281\/zenodo.4764650"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-030-37494-5_5","volume-title":"Agents and Artificial Intelligence","author":"K Liu","year":"2019","unstructured":"Liu, K., L\u00f6ffler, S., Hofstedt, P.: Social golfer problem revisited. In: van den Herik, J., Rocha, A.P., Steels, L. (eds.) ICAART 2019. LNCS (LNAI), vol. 11978, pp. 72\u201399. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-37494-5_5"},{"key":"24_CR15","unstructured":"Rezaei, A.: Golfer: A toolkit for solving social golfer problem (2015). https:\/\/github.com\/arezae4\/golfer"},{"key":"24_CR16","unstructured":"Triska, M.: Solution methods for the social golfer problem (2008). https:\/\/www.metalevel.at\/mst.pdf, Master\u2019s thesis"},{"issue":"1","key":"24_CR17","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10479-011-0866-7","volume":"194","author":"M Triska","year":"2012","unstructured":"Triska, M., Musliu, N.: An effective greedy heuristic for the social golfer problem. Ann. Oper. Res. 194(1), 413\u2013425 (2012). https:\/\/doi.org\/10.1007\/s10479-011-0866-7","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"24_CR18","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10479-010-0702-5","volume":"194","author":"M Triska","year":"2012","unstructured":"Triska, M., Musliu, N.: An improved SAT formulation for the social golfer problem. Ann. Oper. Res. 194(1), 427\u2013438 (2012). https:\/\/doi.org\/10.1007\/s10479-010-0702-5","journal-title":"Ann. Oper. Res."},{"key":"24_CR19","unstructured":"English Bridge Union: Individual competitions. https:\/\/www.ebu.co.uk\/documents\/cmh\/Individuals.pdf"},{"key":"24_CR20","unstructured":"Walser, J.P.: AMPL model of \u2018maximum socializing on the golf course\u2019 (1998). https:\/\/www.csplib.org\/Problems\/prob010\/models\/AMPLmodel.txt.html"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80223-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T23:35:54Z","timestamp":1625182554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80223-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030802226","9783030802233"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80223-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Satisfiability Testing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iiia.csic.es\/sat2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}