Scheduling reach mahjong tournaments using pseudoboolean constraints

DOI10.1007/978-3-030-80223-3_24OpenAlexW3186512348MaRDI QIDQ2118316

Martin Mariusz Lester

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_24

zbMATH Keywords

social golfer problemmahjongpseudoboolean constraintstournament scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Uses Software

• CSPLib
• clasp
• OEIS
• GitHub

Cites Work

• Unnamed Item
• Set constraint model and automated encoding into SAT: application to the social golfer problem
• An effective greedy heuristic for the social golfer problem
• An improved SAT formulation for the social golfer problem
• Ranking whist players
• Solving the MOLR and Social Golfers Problems
• An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
• Scheduling Social Golfers Locally

This page was built for publication: Scheduling reach mahjong tournaments using pseudoboolean constraints