Scheduling reach mahjong tournaments using pseudoboolean constraints

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

Authors: 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

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

Cites Work

• Title not available (Why is that?)
• An effective greedy heuristic for the social golfer problem
• An improved SAT formulation for the social golfer problem
• Set constraint model and automated encoding into SAT: application to the social golfer problem
• An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
• Solving the MOLR and Social Golfers Problems
• Scheduling Social Golfers Locally
• Ranking whist players

Uses Software

• CSPLib
• clasp
• OEIS
• GitHub

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118316)