EDP Sciences logo
Subscriber Authentication Point
Sciengine logo
Search
Menu
All issues Volume 60 / No 1 (January-February 2026) RAIRO-Oper. Res., 60 1 (2026) 173-199 References
Open Access
Issue
RAIRO-Oper. Res.
Volume 60, Number 1, January-February 2026
Page(s) 173 - 199
DOI https://doi.org/10.1051/ro/2025155
Published online 23 February 2026
  • C. Ansótegui, Y. Malitsky, H. Samulowitz, M. Sellmann and K. Tierney, Model-based genetic algorithms for algorithm configuration, in Proceedings of the 24th International Joint Conference on Artificial Intelligence (2012) 733–739. [Google Scholar]
  • G. Audemard and L. Simon, Predicting learnt clauses quality in modern SAT solvers, in Proceedings of the 21st International Joint Conference on Artificial Intelligence (2009) 399–404. [Google Scholar]
  • G. Audemard and L. Simon, On the glucose SAT solver. Int. J. Artif. Intell. Tools 27 (2018) 1840001. [Google Scholar]
  • F. Azevedo, An attempt to dynamically break symmetries in the social golfers problem, in International Symposium on Artificial Intelligence and Mathematics (2006). [Google Scholar]
  • F. Bacchus, GAC via unit propagation, in International Conference on Principles and Practice of Constraint Programming. Springer (2007) 133–147. [Google Scholar]
  • O. Bailleux, Y. Boufkhad and O. Roussel, New encodings of pseudo-boolean constraints into CNF, in International Conference on Theory and Applications of Satisfiability Testing (SAT 2009). Lecture Notes in Computer Science. Springer, Berlin, Heidelberg (2009) 181–194. [Google Scholar]
  • T. Balyo, N. Froleyks, M. Heule, M. Iser, M. J¨arvisalo and M. Suda, SAT competition 2020. J. Satisfiability Boolean Model. Comput. 12 (2021) 1–11. [Google Scholar]
  • A. Biere, M. Heule, H. Van Maaren and T. Walsh, Handbook of Satisfiability. IOS Press, Amsterdam (2009). [Google Scholar]
  • A. Biere, T. Faller, K. Fazekas, M. Fleury, N. Froleyks and F. Pollitt, CaDiCaL, Gimsatul, IsaSAT and Kissat entering the SAT competition 2024, in Proc. of SAT Competition (2024) 8–10. [Google Scholar]
  • D. Briskorn, Sports leagues scheduling: models, combinatorial properties, and optimization algorithms. J. Scheduling 13 (2010) 627–646. [Google Scholar]
  • C.J. Colbourn and J.H. Dinitz, Handbook of Combinatorial Designs. CRC Press, Boca Raton, FL (2006). [Google Scholar]
  • C. Cotta, I. Dotú, A.J. Fernández and P. Van Hentenryck, Scheduling social golfers with memetic evolutionary programming, in International Workshop on Hybrid Metaheuristics. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg (2006) 150–161. [Google Scholar]
  • J.M. Crawford, M.L. Ginsberg, E.M. Luks and A. Roy, Symmetry-breaking predicates for search problems. KR 96 (1996) 148–159. [Google Scholar]
  • I. Dotú and P. Van Hentenryck, Scheduling social tournaments locally. AI Commun. 20 (2007) 15–24. [Google Scholar]
  • N. Eén and N. Sörensson, Translating pseudo-boolean constraints into SAT. J. Satisfiability Boolean Model. Comput. 2 (2006) 1–26. [Google Scholar]
  • N. Froleyks, M. Heule, M. Iser, M. J¨arvisalo and M. Suda, Sat competition 2020. Artif. Intell. 301 (2021) 103572. [Google Scholar]
  • I.P. Gent, Symmetry in constraint satisfaction, in Principles and Practice of Constraint Programming-CP 2001 Workshops (2001) 17–23. [Google Scholar]
  • I. Gent and I. Lynce, A SAT encoding for the social golfer problem (2005). [Google Scholar]
  • I.P. Gent and P. Prosser, A constraint programming approach to the social golfer problem, in Workshop on Modelling and Solving Problems with Constraints (IJCAI-01) (2002). [Google Scholar]
  • W. Harvey, CSPLib problem 010: Social golfers problem (2001). [Google Scholar]
  • W. Harvey and T. Winterer, Solving the MOLR and social golfers problems, in International Conference on Principles and Practice of Constraint Programming. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg (2005) 286–300. [Google Scholar]
  • M. Henz, Scheduling a major college basketball conference-revisited. Oper. Res. 49 (2001) 163–168. [Google Scholar]
  • M.J.H. Heule, M. Suda and S. Szeider, The impact of solver configuration on satisfiability formulas, in Proceedings of the 22nd International Conference on Theory and Applications of Satisfiability Testing. Springer (2019) 170–187. [Google Scholar]
  • A. Ignatiev, A. Morgado and J. Marques-Silva, PySAT: a Python toolkit for prototyping with SAT oracles, in SAT (2018) 428–437. [Google Scholar]
  • M. J¨arvisalo, A. Biere and M. Heule, The impact of CNF formula simplification techniques on modern SAT solvers. Theory Applications of Satisfiability Testing–SAT 2010 (2012) 75–89. [Google Scholar]
  • T.V. Kieu, N.T. Nguyen and K.V. To, Source code and datasets for “an efficient SAT encoding for solving the social golfer problem”. https://github.com/kieuvantuyen01/SCE (2025). [Google Scholar]
  • F. Lardeux, E. Monfroy, B. Crawford and R. Soto, Set constraint model and automated encoding into SAT: application to the social golfer problem. Ann. Oper. Res. 235 (2015) 423–452. [Google Scholar]
  • M. Lester, J. Petch and B.M. Smith, Scheduling reach mahjong tournaments using pseudo-boolean constraints, in Proceedings of the 19th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (2021). [Google Scholar]
  • K. Liu, S. Löffler and P. Hofstedt, Social golfer problem revisited, in International Conference on Agents and Artificial Intelligence. Springer (2019) 72–99. [Google Scholar]
  • I. Lynce and J. Marques-Silva, Efficient data structures for backtrack search SAT solvers. Ann. Math. Artif. Intell. 43 (2006) 137–152. [Google Scholar]
  • J. Marques-Silva, I. Lynce and S. Malik, Conflict-driven clause learning SAT solvers. Handb. Satisfiability 185 (2009) 131–153. [Google Scholar]
  • D.C. Montgomery, Design and Analysis of Experiments. John Wiley & Sons, Hoboken, NJ (2017). [Google Scholar]
  • T. Philipp and P. Steinke, PBLib – a library for encoding pseudo-boolean constraints into CNF, in International Conference on Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science. Springer, Cham (2015) 9–16. [Google Scholar]
  • A. Schaerf, A survey of automated timetabling. Artif. Intell. Rev. 13 (1999) 87–127. [Google Scholar]
  • C. Sinz, Towards an optimal CNF encoding of boolean cardinality constraints, in International Conference on Principles and Practice of Constraint Programming. Springer (2005) 827–831. [Google Scholar]
  • C. Solnon, V.D. Cung, A. Nguyen and C. Artigues, Car sequencing problems: a review of exact and heuristic methods. Eur. J. Oper. Res. 191 (2008) 741–754. [Google Scholar]
  • P. Steinke, T. Philipp and C. Sinz, PBLib – a library of efficient pseudo-boolean encodings, in International Conference on Theory and Applications of Satisfiability Testing (SAT 2009). Springer, Berlin, Heidelberg (2009) 181–194. [Google Scholar]
  • D.R. Stinson, Combinatorial Designs: Constructions and Analysis. Springer Science & Business Media (2004). [Google Scholar]
  • M. Triska and N. Musliu, An improved SAT formulation for the social golfer problem. Ann. Oper. Res. 194 (2012) 427–438. [Google Scholar]
  • T. Walsh, General symmetry breaking constraints, in International Conference on Principles and Practice of Constraint Programming. Springer (2006) 650–664. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.