An improved SAT formulation for the social golfer problem
From MaRDI portal
Publication:1761920
Recommendations
Cites work
- scientific article; zbMATH DE number 1016456 (Why is no real title available?)
- scientific article; zbMATH DE number 867473 (Why is no real title available?)
- scientific article; zbMATH DE number 956863 (Why is no real title available?)
- Propagation algorithms for lexicographic ordering constraints
- Scheduling Social Golfers Locally
- Solving Kirkman's schoolgirl problem in a few seconds
- Solving the MOLR and Social Golfers Problems
- The complexity of completing partial Latin squares
Cited in
(8)- Scheduling reach mahjong tournaments using pseudoboolean constraints
- Scheduling Social Golfers Locally
- Solving the MOLR and Social Golfers Problems
- An effective greedy heuristic for the social golfer problem
- Scheduling social tournaments locally
- Set constraint model and automated encoding into SAT: application to the social golfer problem
- A greedy algorithm for the social golfer and the Oberwolfach problem
- Multicriteria models for planning power-networking events
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)