An improved SAT formulation for the social golfer problem
From MaRDI portal
Publication:1761920
DOI10.1007/S10479-010-0702-5zbMATH Open1251.90194OpenAlexW2023331514MaRDI QIDQ1761920FDOQ1761920
Authors: Markus Triska, Nysret Musliu 
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-010-0702-5
Recommendations
Cites Work
- The complexity of completing partial Latin squares
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving the MOLR and Social Golfers Problems
- Scheduling Social Golfers Locally
- Solving Kirkman's schoolgirl problem in a few seconds
- Propagation algorithms for lexicographic ordering constraints
Cited In (8)
- Set constraint model and automated encoding into SAT: application to the social golfer problem
- Scheduling reach mahjong tournaments using pseudoboolean constraints
- Multicriteria models for planning power-networking events
- An effective greedy heuristic for the social golfer problem
- Scheduling social tournaments locally
- A greedy algorithm for the social golfer and the Oberwolfach problem
- Solving the MOLR and Social Golfers Problems
- Scheduling Social Golfers Locally
Uses Software
This page was built for publication: An improved SAT formulation for the social golfer problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761920)
